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 条
  • [1] Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five
    Gao, Fei
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (06) : 3742 - 3757
  • [2] Optimal ternary constant-composition codes with weight four and distance six
    Wei, Hengjia
    Zhang, Hui
    Zhu, Mingzhi
    Ge, Gennian
    DISCRETE MATHEMATICS, 2015, 338 (03) : 72 - 87
  • [3] Construction of ternary constant-composition codes with weight three and minimum distance four
    Svanström, M
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 143 - 143
  • [4] Constructions of ternary constant-composition codes with weight three
    Svanström, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (07) : 2644 - 2647
  • [5] Enumeration of optimal ternary constant-composition codes
    Bogdanova, G.T.
    Kapralov, S.N.
    Problemy Peredachi Informatsii, 2003, 39 (04): : 35 - 40
  • [6] Enumeration of Optimal Ternary Constant-Composition Codes
    G. T. Bogdanova
    S. N. Kapralov
    Problems of Information Transmission, 2003, 39 (4) : 346 - 351
  • [7] Group divisible codes and their application in the construction of optimal constant-composition codes of weight three
    Chee, Yeow Meng
    Ge, Gennian
    Ling, Alan C. H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) : 3552 - 3564
  • [8] Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
    Zhang, Hui
    Ge, Gennian
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (05) : 2188 - 2203
  • [9] A family of optimal constant-composition codes
    Ding, CS
    Yuan, J
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (10) : 3668 - 3671
  • [10] Bounds and constructions for ternary constant-composition codes
    Svanström, M
    Östergård, PRJ
    Bogdanova, GT
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) : 101 - 111
12345