Optimal ternary constant-composition codes with weight four and distance three

被引：2
作者：
Liang, Miao [1 ,2 ]
Ji, Lijun [1 ]
机构：
[1] Soochow Univ, Dept Math, Suzhou 215006, Peoples R China
[2] Suzhou Vocat Univ, Dept Math & Phys, Suzhou 215104, Peoples R China
来源：
DISCRETE MATHEMATICS | 2019年 / 342卷 / 04期
关键词：
Constant-composition code; Overlarge set of packing triple system; One-factorization; k-cycle free; LARGE SETS; LOWER BOUNDS; CONSTRUCTIONS; COMPLETION; PARTITIONS; EXISTENCE; PACKINGS; SPECTRUM; SYSTEMS; TRIPLES;
D O I：
10.1016/j.disc.2018.12.021
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A concept of good overlarge set of disjoint packing triple systems (OLPTS) is introduced in order to characterize a ternary constant-composition code with weight four, distance three and the composition [3, 1]. A recursive construction for good OLPTSs via fan designs is also given. 4-cycle free one-factorizations of the complete graphs are also used to construct optimal ternary constant-composition codes with weight four distance three and the composition [2, 2]. Consequently, a few infinite classes of optimal ternary constant composition codes with weight four and distance three are obtained. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：1079 / 1088
页数：10
相关论文
共 45 条
[1]  
Bao JJ, 2015, DESIGN CODE CRYPTOGR, V77, P217, DOI 10.1007/s10623-014-0001-2
[2]  
BOGDANOVA GT, 2003, PROBL PEREDACHI INF, V39, P35
[3]   A NEW TABLE OF CONSTANT WEIGHT CODES [J].
BROUWER, AE ;
SHEARER, JB ;
SLOANE, NJA ;
SMITH, WD .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1334-1380
[4]   Large sets of disjoint packings on 6k+5 points [J].
Cao, H ;
Ji, L ;
Zhu, L .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2004, 108 (02) :169-183
[5]   A completion of LS(2n41) [J].
Chang, Yanxun ;
Ji, Lijun ;
Zheng, Hao .
DISCRETE MATHEMATICS, 2017, 340 (05) :1080-1085
[6]   Large sets of Kirkman triple systems and related designs [J].
Chang, Yanxun ;
Zhou, Junling .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2013, 120 (03) :649-670
[7]   Group divisible codes and their application in the construction of optimal constant-composition codes of weight three [J].
Chee, Yeow Meng ;
Ge, Gennian ;
Ling, Alan C. H. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) :3552-3564
[8]   Improved lower bounds for constant GC-content DNA codes [J].
Chee, Yeow Meng ;
Ling, San .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) :391-394
[9]   FURTHER RESULTS ON LARGE SETS OF DISJOINT GROUP-DIVISIBLE DESIGNS [J].
CHEN, D ;
LINDNER, CC ;
STINSON, DR .
DISCRETE MATHEMATICS, 1992, 110 (1-3) :35-42
[10]  
CHEN D, 1993, ARS COMBINATORIA, V35, P103
12345