TY - JOUR
T1 - On constant composition codes
AU - Chu, Wensong
AU - Colbourn, Charles
AU - Dukes, Peter
N1 - Funding Information:
Research of the authors is supported by the Army Research Office under Grant number DAAD 19-01-1-0406. Thanks to Malcolm Greig, Manish Gupta, and Violet Syrotiuk for useful discussions concerning this research.
PY - 2006/4/15
Y1 - 2006/4/15
N2 - A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes in the case that each symbol occurs exactly once. Constant composition codes arise in powerline communication and balanced scheduling, and are used in the construction of permutation codes. In this paper, direct and recursive methods are developed for the construction of constant composition codes.
AB - A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes in the case that each symbol occurs exactly once. Constant composition codes arise in powerline communication and balanced scheduling, and are used in the construction of permutation codes. In this paper, direct and recursive methods are developed for the construction of constant composition codes.
KW - Constant composition code
KW - Constant weight code
KW - Permutation code
UR - http://www.scopus.com/inward/record.url?scp=33644785945&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33644785945&partnerID=8YFLogxK
U2 - 10.1016/j.dam.2005.09.009
DO - 10.1016/j.dam.2005.09.009
M3 - Article
AN - SCOPUS:33644785945
SN - 0166-218X
VL - 154
SP - 912
EP - 929
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 6
ER -