Title :
On constant-composition codes over Zq
Author :
Luo, Yuan ; Fu, Fang-Wei ; Vinck, A. J Han ; Chen, Wende
Author_Institution :
Comput. Sci. & Eng. Dept., Shanghai Jiao Tong Univ., China
Abstract :
A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the q-ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham-Sloane bound for binary constant-weight codes. In addition, three construction methods of constant-composition codes are presented, and a number of optimum constant-composition codes are obtained by using these constructions.
Keywords :
Hadamard matrices; binary codes; optimisation; Graham-Sloane bound; Hadamard matrix; Johnson bound; Plotkin bound; asymptotically optimal bound; binary constant-weight codes; construction methods; lower bound; maximum size; optimum constant-composition codes; q-ary constant-composition codes; simplex code; Computer science; Computer science education; Concatenated codes; Educational programs; Error correction; Error correction codes; Mathematics; Modular construction; Modulation coding; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2003.819339
