A Construction of Optimal Constant Composition Codes
Designs, Codes and Cryptography
Constructions of partitioned difference families
European Journal of Combinatorics
Constructions of optimal GDRP(n,λ;v)'s of type λ1µm-1
Discrete Applied Mathematics
A class of optimal constant composition codes from GDRPs
Designs, Codes and Cryptography
Distance-increasing mappings from binary vectors to constant composition vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Equidistant frequency permutation arrays and related constant composition codes
Designs, Codes and Cryptography
Constructions of a class of partition difference family
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Linear size optimal q-ary constant-weight codes and constant-composition codes
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
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.