IEEE Transactions on Information Theory · 2003 · 79 citations · 22 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyData StructuresCoding TheoryError Control CodingError-correcting CodesBinary CodesBounds On CodesCode BoundsCodes Over Finite FieldsConstant-weight CodesConstructionMinimum DistanceMinimum Distance Bounds
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.
22
The theory of error-correcting codes
James L. Massey · Proceedings of the IEEE · 1980 · 684 citations
A new table of constant weight codes
A.E. Brouwer, James B. Shearer, N. J. A. Sloane et al. · IEEE Transactions on Information Theory · 1990 · 434 citations
Binary codes with specified minimum distance
M. Plotkin · IEEE Transactions on Information Theory · 1960 · 361 citations
Lower bounds for constant weight codes
R. L. Graham, N. J. A. Sloane · IEEE Transactions on Information Theory · 1980 · 272 citations