Title :
Bounds and constructions for ternary constant-composition codes
Author :
Svanström, Mattias ; Östergård, Patric R J ; Bogdanova, Galina T.
Author_Institution :
Dept. of Electr. Eng., Linkoping Univ., Sweden
fDate :
1/1/2002 12:00:00 AM
Abstract :
The problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in each codeword. Upper and lower bounds on the size of such codes under the Hamming metric are discussed, where the lower bounds follow from constructions of good codes. Some of the results are obtained by explicitly finding codes by computer search. A table of exact values and best known bounds on the maximum size for codes of length at most 10 is presented
Keywords :
Hadamard matrices; block codes; search problems; ternary codes; Hadamard matrices; Hamming metric; Harruning distance; Jacobsthal matrices; block code; code bounds; code constructions; code length; code size; codeword; combinatorial objects; computer search; constant-composition codes; large minimum distance codes; lower bounds; ternary code maximum size; ternary constant-composition codes; ternary linear cyclic Golay code; unrestricted codes; upper bounds; Additives; Binary codes; Block codes; Computer science; Councils; Hamming distance; Hamming weight; Informatics; Linear code; Mathematics;
Journal_Title :
Information Theory, IEEE Transactions on
