Infinite Families of Near MDS Codes Holding t-Designs

DOI10.1109/TIT.2020.2990396zbMath1448.94257arXiv1910.08265MaRDI QIDQ5124515

Cunsheng Ding, Chun-Ming Tang

Publication date: 29 September 2020

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

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

zbMATH Keywords

AMDS codesalmost maximum distance separable (almost MDS) codesinfinite family of NMDS codesinfinite family of t-designsnear maximum distance separable (near MDS) codes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05)

Related Items (24)

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 ⋮ A class of almost MDS codes ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\) ⋮ 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: Infinite Families of Near MDS Codes Holding t-Designs