On constant composition codes
On constant composition codes
复制标题
DOI：
10.1016/j.dam.2005.09.009
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
W. Chu;C. Colbourn;P. Dukes
中科院分区：
文献类型：
--
作者：
W. Chu;C. Colbourn;P. Dukes
K元字母表上的常量合成码具有这样的特性，即对于每个码字，码字内的k个符号的出现次数相同。这些专门用于在二进制情况下的恒重码，以及在每个符号恰好出现一次的情况下的排列码。恒定合成码产生于电力线通信和均衡调度中，用于构造排列码。本文提出了构造常数合成码的直接方法和递归方法。
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.