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
相关论文
共 50 条
  • [11] Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six
    Lan, Liantao
    Chang, Yanxun
    DISCRETE MATHEMATICS, 2018, 341 (04) : 1010 - 1020
  • [12] Combinatorial constructions of optimal constant-composition codes
    Ding, CS
    Yin, JX
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3671 - 3674
  • [13] Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
    Chee, Yeow Meng
    Dau, Son Hoang
    Ling, Alan C. H.
    Ling, San
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 140 - 151
  • [14] Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5
    Zhang, Hui
    Zhang, Xiande
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) : 2706 - 2718
  • [15] A construction for constant-composition codes
    Ding, Yang
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) : 3738 - 3741
  • [16] Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five
    Zhang, Hui
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (03) : 1617 - 1629
  • [17] Quaternary Constant-Composition Codes With Weight 4 and Distances 5 or 6
    Zhu, Mingzhi
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (09) : 6012 - 6022
  • [18] On constant-composition codes over Zq
    Luo, Y
    Fu, FW
    Vinck, AJH
    Chen, W
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (11) : 3010 - 3016
  • [19] A New Construction for Constant-Composition Codes
    Wang, Xin
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (12) : 7815 - 7821
  • [20] On a class of optimal constant weight ternary codes
    Kharaghani, Hadi
    Suda, Sho
    Zaitsev, Vlad
    DESIGNS CODES AND CRYPTOGRAPHY, 2023, 91 (01) : 45 - 54