Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)

DOI10.1016/j.ffa.2023.102338arXiv2208.08578OpenAlexW4388921248MaRDI QIDQ6185648

Cui Ling Fan, Li Xu, Dongchun Han

Publication date: 8 January 2024

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

hyperovalovalNMDS codesmaximum distance separable (MDS) codeslocally recoverable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sets of vectors of a finite vector space in which every subset of basis size is a basis. II
• Codes of small defect
• Near-MDS codes from elliptic curves
• Difference sets and hyperovals
• Maximal \((n,3)\)-arcs in PG(2,11)
• On near-MDS codes
• Near-MDS codes over some small fields
• Divisible arcs, divisible codes, and the extension problem for arcs and codes
• The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
• On sets of vectors of a finite vector space in which every subset of basis size is a basis
• Near-MDS codes arising from algebraic curves
• Near MDS codes from oval polynomials
• A class of almost MDS codes
• The minimum locality of linear codes
• Constructions of near MDS codes which are optimal locally recoverable codes
• On the Locality of Codeword Symbols
• New MDS or Near-MDS Self-Dual Codes
• Multiple Blocking Sets and Arcs in Finite Planes
• NMDS codes of maximal length over F/sub q/,8≤q≤11
• Infinite Families of Near MDS Codes Holding t-Designs
• Finite Geometry and Combinatorial Applications
• Maximum distance<tex>q</tex>-nary codes
• A construction of optimal locally recoverable codes

This page was built for publication: Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)