Group divisible codes and their application in the construction of optimal constant-composition codes of weight three

被引:23
作者
Chee, Yeow Meng [1 ]
Ge, Gennian [2 ]
Ling, Alan C. H. [3 ]
机构
[1] Nanyang Technol Univ, Sch Math & Phys Sci, Div Math Sci, Singapore 637371, Singapore
[2] Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R China
[3] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
基金
中国国家自然科学基金; 新加坡国家研究基金会;
关键词
constant-composition codes; group divisible codes; group divisible designs; recursive constructions;
D O I
10.1109/TIT.2008.926349
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition codes. Large classes of group divisible codes are constructed which enabled the determination of the sizes of optimal constant-composition codes of weight three (and specified distance), leaving only four cases undetermined. Previously, the sizes of constant-composition codes of weight three were known only for those of sufficiently large length.
引用
收藏
页码:3552 / 3564
页数:13
相关论文
共 35 条
[1]  
Abel R. J. R., 2007, CRC HDB COMBINATORIA, P160
[2]  
BOGDANOVA GT, 2003, PROBL PEREDACHI INF, V39, P35
[3]   GROUP DIVISIBLE DESIGNS WITH BLOCK-SIZE 4 [J].
BROUWER, AE ;
SCHRIJVER, A ;
HANANI, H .
DISCRETE MATHEMATICS, 1977, 20 (01) :1-10
[4]   The PBD-closure of constant-composition codes [J].
Chee, Yeow Meng ;
Ling, Alan C. H. ;
Ling, San ;
Shen, Hao .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (08) :2685-2692
[5]   Uniform group divisible designs with block sizes three and n [J].
Chee, YM ;
Ling, ACH .
GRAPHS AND COMBINATORICS, 2002, 18 (03) :421-445
[6]  
CHU W, 2005, J COMBIN MATH COMBIN, V54, P57
[7]   On constant composition codes [J].
Chu, WS ;
Colbourn, CJ ;
Dukes, P .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (06) :912-929
[8]   Constructions for permutation codes in powerline communications [J].
Chu, WS ;
Colbourn, CJ ;
Dukes, P .
DESIGNS CODES AND CRYPTOGRAPHY, 2004, 32 (1-3) :51-64
[9]   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
[10]   A NEW CLASS OF GROUP DIVISIBLE DESIGNS WITH BLOCK SIZE-3 [J].
COLBOURN, CJ ;
HOFFMAN, DG ;
REES, R .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1992, 59 (01) :73-89