An infinite family of linear codes supporting 4-designs

01/01/2020
by   Chunming Tang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

Infinite families of cyclic and negacyclic codes supporting 3-designs

Interplay between coding theory and combinatorial t-designs has been a h...
research
11/21/2022

Exceptional scattered sequences

The concept of scattered polynomials is generalized to those of exceptio...
research
08/23/2020

The linear codes of t-designs held in the Reed-Muller and Simplex codes

A fascinating topic of combinatorics is t-designs, which have a very lon...
research
10/18/2019

Infinite families of near MDS codes holding t-designs

An [n, k, n-k+1] linear code is called an MDS code. An [n, k, n-k] linea...
research
10/03/2020

An Infinite, Converging, Sequence of Brocard Porisms

The Brocard porism is a known 1d family of triangles inscribed in a circ...
research
06/21/2021

Infinite families of linear codes supporting more t-designs

Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-se...
research
07/12/2020

Shortened Linear Codes over Finite Fields

The puncturing and shortening technique are two important approaches to ...

Please sign up or login with your details

Forgot password? Click here to reset