Combinatorial constructions of optimal constant-composition codes

被引：72
作者：
Ding, CS
Yin, JX
机构：
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[2] Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 10期
关键词：
constant-composition codes (CCCs); constant-weight codes; generalized double resolvable packing designs;
D O I：
10.1109/TIT.2005.855612
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：3671 / 3674
页数：4
相关论文
共 26 条
[1]  
Beth T., 1999, DESIGN THEORY, V69
[2]   CONFIGURATION MATRICES OF GROUP CODES [J].
BLAKE, IF .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) :95-100
[3]   CODING WITH PERMUTATIONS [J].
BLAKE, IF ;
COHEN, G ;
DEZA, M .
INFORMATION AND CONTROL, 1979, 43 (01) :1-19
[4]   PERMUTATION CODES FOR DISCRETE CHANNELS [J].
BLAKE, IF .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (01) :138-140
[5]   Enumeration of Optimal Ternary Constant-Composition Codes [J].
G. T. Bogdanova ;
S. N. Kapralov .
Problems of Information Transmission, 2003, 39 (4) :346-351
[6]  
BOGDANOVA GT, 2004, DESIGN CODE CRYPTOGR, V32, P51
[7]  
CHU W, IN PRESS J COMB MATH
[8]  
CHU W, CONSTANT COMPOSITION
[9]   Constructions for permutation codes in powerline communications [J].
Chu, WS ;
Colbourn, CJ ;
Dukes, P .
DESIGNS CODES AND CRYPTOGRAPHY, 2004, 32 (1-3) :51-64
[10]   Permutation arrays for powerline communication and mutually orthogonal Latin squares [J].
Colbourn, CJ ;
Klove, T ;
Ling, ACH .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) :1289-1291
123