An Infinite Family of Linear Codes Supporting 4-Designs
From MaRDI portal
Publication:5151705
DOI10.1109/TIT.2020.3032600zbMath1465.94117arXiv2001.00158OpenAlexW3094527023MaRDI QIDQ5151705
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
Related Items (27)
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 ⋮ 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 ⋮ Constructions of near MDS codes which are optimal locally recoverable codes ⋮ 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
This page was built for publication: An Infinite Family of Linear Codes Supporting 4-Designs
