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
来源：
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
相关论文
共 50 条
  • [31] On the constructions of constant-composition codes from perfect nonlinear functions
    Li Chao
    Li Qiang
    Ling San
    SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2009, 52 (06): : 964 - 973
  • [32] Why Constant-Composition Codes Reduce Nonlinear Interference Noise
    Borujeny, Reza Rafie
    Kschischang, Frank R.
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2023, 41 (14) : 4691 - 4698
  • [33] On the constructions of constant-composition codes from perfect nonlinear functions
    LI Chao 1
    2 National Mobile Communications Research Laboratory
    3 Division of Mathematical Sciences
    Science China(Information Sciences), 2009, (06) : 964 - 973
  • [34] Several classes of optimal ternary cyclic codes with minimal distance four
    Wang, Lisha
    Wu, Gaofei
    FINITE FIELDS AND THEIR APPLICATIONS, 2016, 40 : 126 - 137
  • [35] Two families of optimal ternary cyclic codes with minimal distance four
    Zhao, Hai
    Luo, Rong
    Sun, Tongjun
    FINITE FIELDS AND THEIR APPLICATIONS, 2022, 79
  • [36] New classes of optimal ternary cyclic codes with minimum distance four
    Zha, Zhengbang
    Hu, Lei
    FINITE FIELDS AND THEIR APPLICATIONS, 2020, 64 (64)
  • [37] Linear Size Constant-Composition Codes Meeting the Johnson Bound
    Chee, Yeow Meng
    Zhang, Xiande
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 909 - 917
  • [38] Two Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four
    He, Chao
    Ran, Xiaoqiong
    Luo, Rong
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (07) : 1049 - 1052
  • [39] The sizes of optimal q-ary codes of weight three and distance four:: A complete solution
    Chee, Yeow Meng
    Dau, Son Hoang
    Ling, Alan C. H.
    Ling, San
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) : 1291 - 1295
  • [40] Optimal cyclic quaternary constant-weight codes of weight three
    Lan, Liantao
    Chang, Yanxun
    JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (04) : 174 - 192
12345