Citations
Altmetric:
Alternative Title
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
Code construction, Constant-composition code, Constant-weight code, Hadamard matrix, Johnson bound, Plotkin bound, Simplex code
Source Title
IEEE Transactions on Information Theory
Publisher
Series/Report No.
Collections
Rights
Date
2003-11
DOI
10.1109/TIT.2003.819339
Type
Article