Near MDS codes from oval polynomials

DOI10.1016/J.DISC.2020.112277MaRDI QIDQ2659189zbMATH OpenOpenAlexFDO

Authors Qiuyan Wang, Ziling Heng

Publication date 25 March 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

linear codenear maximum distance separable (MDS) codeo-polynomial

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: A linear code with parameters of the form $[n,k,n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n,k,n-k]$ is said to be almost MDS (i.e., almost maximum distance separable) or AMDS for short. A code is said to be near maximum distance separable (in short, near MDS or NMDS) if both the code and its dual are almost maximum distance separable. Near MDS codes correspond to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. In this paper, seven infinite families of $[2^m+1,3,2^m-2]$ near MDS codes over $gf(2^m)$ and seven infinite families of $[2^m+2,3,2^m-1]$ near MDS codes over $gf(2^m)$ are constructed with special oval polynomials for odd $m$. In addition, nine infinite families of optimal $[2^m+3,3,2^m]$ near MDS codes over $gf(2^m)$ are constructed with oval polynomials in general.

Recommendations

• On near-MDS codes
• Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
• Near-MDS codes from elliptic curves
• Near-MDS codes over some small fields
• Constructions of near MDS codes which are optimal locally recoverable codes

Cites work

• Almost MDS codes
• An Infinite Family of Linear Codes Supporting 4-Designs
• Codes of small defect
• Difference sets and hyperovals
• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• Infinite Families of Near MDS Codes Holding t-Designs
• Near-MDS codes over some small fields
• On near-MDS codes
• Quasi-cyclic NMDS codes
• Self-Dual Near MDS Codes from Elliptic Curves

Cited in

(19)

• On near-MDS codes
• The minimum locality of linear codes
• On near-MDS codes and caps
• Constructions of near MDS codes which are optimal locally recoverable codes
• Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
• A construction of optimal locally recoverable codes
• New classes of NMDS codes with dimension 3
• Near MDS codes with dimension 4 and their application in locally recoverable codes
• New infinite families of near MDS codes holding \(t\)-designs
• Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
• Four new families of NMDS codes with dimension 4 and their applications
• Explicit constructions of NMDS self-dual codes
• Super-exponentially many NMDS codes arising from regular hyperovals
• Some sufficient conditions for \((\mathcal{A}\ast \mathcal{B})^\perp\) with an error-correcting pair \((\mathcal{A},\mathcal{B})\)
• An infinite family of AMDS codes holding 2-designs
• Characterizations of NMDS codes and a proof of the Geng-Yang-Zhang-Zhou conjecture
• Linear codes from arcs and quadrics
• The extended codes of NMDS codes
• Combinatorial t-designs from finite abelian groups and elliptic curve codes

This page was built for publication: Near MDS codes from oval polynomials

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