共 50 条
Optimal ternary constant-composition codes with weight four and distance three
被引:1
|作者:
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
关键词:
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
相关论文