Combinatorial constructions of optimal constant-composition codes

Combinatorial constructions of optimal constant-composition codes
复制标题

DOI:
10.1109/tit.2005.855612
复制
发表时间:
2005-10
影响因子:
2.5
通讯作者:
C. Ding;Jianxing Yin
C. Ding;Jianxing Yin
中科院分区:
计算机科学2区
文献类型:
--
作者:
C. Ding;Jianxing Yin

文献摘要

被引文献

相似文献

等重码(CCCS)是一类特殊的等重码。它们包括排列码作为子类。建立了CCCS与广义双可解包装设计之间的联系,并利用它构造了几个最优CCCS无穷级数。
Constant-composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. In this correspondence, a link between CCCs and generalized double resolvable packing designs is developed, and used to construct several infinite series of optimal CCCs.