An Infinite Family of Linear Codes Supporting 4-Designs

DOI10.1109/TIT.2020.3032600MaRDI QIDQ5151705zbMATH OpenOpenAlexFDO

Authors Cunsheng Ding, Chun-Ming Tang

Publication date 22 February 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.00158

Mathematics Subject Classification ID

Other designs, configurations (05B30) Linear codes (general theory) (94B05) Cyclic codes (94B15)

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 $tgeq4$ 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 $mathrmGF(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 in

(45)

• The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\)
• Linear codes from support designs of ternary cyclic codes
• Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
• A class of affine-invariant codes and their support 2-designs
• Book review of: C. Ding and C. Tang, Designs from linear codes
• Near MDS codes from oval polynomials
• An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
• Some t-designs from BCH codes
• The minimum locality of linear codes
• Constructions of near MDS codes which are optimal locally recoverable codes
• The preparata codes and a class of 4‐designs
• Infinite families of 2-designs from a class of affine-invariant codes
• Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
• Dimensions of nonbinary antiprimitive BCH codes and some conjectures
• A construction of optimal locally recoverable codes
• Introduction to the special issue dedicated to Cunsheng Ding on the occasion of his 60th birthday
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
• Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
• The first infinite family of orthogonal Steiner systems \(\mathrm{S}(3,5,v)\)
• Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
• Infinite families of 2‐designs derived from affine‐invariant codes
• Some 3-designs and shortened codes from binary cyclic codes with three zeros
• Constructions of cyclic codes and extended primitive cyclic codes with their applications
• Near MDS codes with dimension 4 and their application in locally recoverable codes
• The projective general linear group \(\mathrm{PGL}(2, 5^m)\) and linear codes of length \(5^m+1\)
• New infinite families of near MDS codes holding \(t\)-designs
• New support 5-designs from lifted linear codes
• BCH cyclic codes
• Mutually disjoint Steiner systems from BCH codes
• Some results on the dimension and Bose distance of the antiprimitive BCH codes
• Some constacyclic BCH codes with good parameters
• Combinatorial t-designs and strongly regular graphs from projective codes over finite fields
• Infinite families of 3-designs from special symmetric polynomials
• Super-exponentially many NMDS codes arising from regular hyperovals
• An infinite family of AMDS codes holding 2-designs
• On two conjectures of the duals of AMDS BCH codes
• The dual codes of two families of BCH codes
• Double-twisted Reed-Solomon codes with twists (1, 3) and general hooks over finite fields
• The support designs of several families of lifted linear codes
• Constructions of several families of MDS codes and NMDS codes
• LCD and non-LCD (A)MDS DTRS codes with all possible hooks
• Constructions of t-designs from the Gold function
• The extended codes of NMDS codes
• AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)
• On non-GRS MDS cyclic codes

This page was built for publication: An Infinite Family of Linear Codes Supporting 4-Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151705)