Steiner systems S(2, 4, 3m-1/2) and 2-designs from ternary linear codes of length 3m-1/2

被引:0
作者
Tang, Chunming [1 ]
Ding, Cunsheng [2 ]
Xiong, Maosheng [3 ]
机构
[1] China West Normal Univ, Sch Math & Informat, Nanchong 637002, Sichuan, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
[3] Hong Kong Univ Sci & Technol, Dept Math, Kowloon, Clear Water Bay, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Cyclic code; Linear code; t-design; Steiner system; SELF-DUAL CODE; INFINITE FAMILIES; 3-DESIGNS; DESIGNS;
D O I
10.1007/s10623-019-00651-8
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Coding theory and t-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight distribution. We determine the weight distributions of some shortened codes and punctured codes of these three-weight subcodes. These shortened and punctured codes contain some codes that have the same parameters as the best ternary linear codes known in the database maintained by Markus Grassl at . These three-weight subcodes with a special weight distribution do not satisfy the conditions of the Assmus-Mattson theorem and do not admit 2-transitive or 2-homogeneous automorphism groups in general. By employing the theory of projective geometries and projective generalized Reed-Muller codes, we prove that they still hold 2-designs. We also determine the parameters of these 2-designs. This paper mainly confirms some recent conjectures of Ding and Li regarding Steiner systems and 2-designs from a special type of ternary projective codes.
引用
收藏
页码:2793 / 2811
页数:19
相关论文
共 29 条
[21]   Tight 2-designs and perfect 1-codes in Doob graphs [J].
Koolen, JH ;
Munemasa, A .
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 2000, 86 (02) :505-513
[22]   Narrow-Sense BCH Codes Over GF(q) With Length n = qm-1/q-1 [J].
Li, Shuxing ;
Ding, Cunsheng ;
Xiong, Maosheng ;
Ge, Gennian .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) :7219-7236
[23]  
Lidl R., 1997, Finite Fields
[24]  
MacWilliams F.J., 1977, THEORY ERROR CORRECT
[25]   A new quasi-symmetric 2-(56,16,6) design obtained from codes [J].
Munemasa, A ;
Tonchev, VD .
DISCRETE MATHEMATICS, 2004, 284 (1-3) :231-234
[26]  
Tonchev VD, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P1229
[27]   Linear perfect codes and a characterization of the classical designs [J].
Tonchev, VD .
DESIGNS CODES AND CRYPTOGRAPHY, 1999, 17 (1-3) :121-128
[28]  
Tonchev VD, 2007, HDB COMBINATORIAL DE, P677
[29]   Secret sharing schemes from three classes of linear codes [J].
Yuan, J ;
Ding, CS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :206-212