On Constant-Composition Codes Over Z q

Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2003.819339

Title:	On Constant-Composition Codes Over Z q
Authors:	Luo, Y. Fu, F.-W. Vinck, A.J.H. Chen, W.
Keywords:	Code construction Constant-composition code Constant-weight code Hadamard matrix Johnson bound Plotkin bound Simplex code
Issue Date:	Nov-2003
Citation:	Luo, Y., Fu, F.-W., Vinck, A.J.H., Chen, W. (2003-11). On Constant-Composition Codes Over Z q. IEEE Transactions on Information Theory 49 (11) : 3010-3016. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2003.819339
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.
Source Title:	IEEE Transactions on Information Theory
URI:	http://scholarbank.nus.edu.sg/handle/10635/114907
ISSN:	00189448
DOI:	10.1109/TIT.2003.819339
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check