Infinite families of 2-designs and 3-designs from linear codes

The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-designs are also presented.

[1]  Cunsheng Ding,et al.  Narrow-Sense BCH Codes over $\gf(q)$ with Length $n=\frac{q^m-1}{q-1}$ , 2016, ArXiv.

[2]  Tadao Kasami,et al.  On the Weight Enumeration of Weights Less than 2.5d of Reed-Muller Codes , 1976, Inf. Control..

[3]  Reinhard Laue,et al.  t -Designs with t ≥ 3 , 2006 .

[4]  Cunsheng Ding,et al.  Three-weight cyclic codes and their weight distributions , 2016, Discret. Math..

[5]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[6]  Robert Winter,et al.  Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theory , 2008, 0812.3731.

[7]  W. Marsden.  I and J , 2012 .

[8]  H. Hanani,et al.  On steiner systems , 1964 .

[9]  Cunsheng Ding,et al.  The weight distribution of a class of linear codes from perfect nonlinear functions , 2006, IEEE Transactions on Information Theory.

[10]  H. Mattson,et al.  New 5-designs , 1969 .

[11]  Susanne Ebersbach,et al.  Designs And Their Codes , 2016 .

[12]  Cunsheng Ding,et al.  The dimension and minimum distance of two classes of primitive BCH codes , 2016, Finite Fields Their Appl..

[13]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[14]  Cunsheng Ding,et al.  Infinite families of 3-designs from a type of five-weight code , 2018, Des. Codes Cryptogr..

[15]  C. Ding.  Codes From Difference Sets , 2014 .

[16]  Cunsheng Ding,et al.  Linear codes from perfect nonlinear mappings and their secret sharing schemes , 2005, IEEE Transactions on Information Theory.

[17]  Marshall Hall,et al.  Codes and Designs , 1981, J. Comb. Theory, Ser. A.

[18]  Tadao Kasami,et al.  On the weight structure of Reed-Muller codes , 1970, IEEE Trans. Inf. Theory.

[19]  H. Hanani.  The Existence and Construction of Balanced Incomplete Block Designs , 1961 .

[20]  Cunsheng Ding,et al.  Hamming weights in irreducible cyclic codes , 2011, Discret. Math..

[21]  Colin D. Reid,et al.  Steiner systems S(2, 4,v) - a survey , 2010 .

[22]  Ian F. Blake,et al.  Coding and Combinatorics , 1975 .

[23]  H. Mattson,et al.  Coding and Combinatorics , 1974 .

[24]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .