An infinite family of linear codes supporting 4-designs

2020/01/01 by Tang, Chunming, Ding, Cunsheng · 1 citation
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2001.00158

Abstract

The first linear code supporting a 4-design was the [11, 6, 5] ternary Golay code discovered in 1949 by Golay. In the past 71 years, sporadic linear codes holding 4-designs or 5-designs were discovered and many infinite families of linear codes supporting 3-designs were constructed. However, the question as to whether there is an infinite family of linear codes holding an infinite family of t-designs for t≥ 4 remains open for 71 years. This paper settles this long-standing problem by presenting an infinite family of BCH codes of length 2^2m+1+1 over GF(2^2m+1) holding an infinite family of 4-(2^2m+1+1, 6, 2^2m-4) designs. Moreover, an infinite family of linear codes holding the spherical design S(3, 5, 4^m+1) is presented.

Cited by

• On the Hamming Weight Functions of Linear Codes

Related

• Infinite families of linear codes supporting more t-designs
• Infinite families of 2-designs and 3-designs from linear codes
• Infinite families of t-designs from a type of five-weight codes
• Infinite families of near MDS codes holding t-designs
• Infinite families of 2-designs from two classes of linear codes