On Constant-Composition Codes Over
On Constant-Composition Codes Over
复制标题
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Yuan Luo;Fang-Wei Fu;A. Vinck;Wende Chen
中科院分区：
文献类型：
--
作者：
Yuan Luo;Fang-Wei Fu;A. Vinck;Wende Chen
恒定合成码是一种特殊的恒重码，其约束是每个符号在每个码字中应该出现给定的次数。在这一通信中，我们给出了至少具有最小最小距离的元常数复合码的最大长度的下界。这个界是渐近最优的，推广了二元等重码的Graham-Sloane界。此外，还给出了常复合码的三种构造方法，并利用这三种构造方法得到了若干最佳常复合码。
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 -ary constant-composition codes with min- imum distance at least . This bound is asymptotically optimal and gener- alizes the Graham-Sloane bound for binary constant-weight codes. In ad- dition, three construction methods of constant-composition codes are pre- sented, and a number of optimum constant-composition codes are obtained by using these constructions.