On Constant Composition Codes over Zq
In: IEEE Transactions on Information Theory, Jg. 49 (2003) ; Nr. 11, S. 3010-3016
Zeitschriftenaufsatz / Fach: Informatik
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 -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.