Maximal (\(n\),3)-arcs in PG(2,13)

DOI10.1016/j.disc.2004.04.043zbMath1081.51009OpenAlexW2003235766MaRDI QIDQ557087

Alfredo Milani, Fernanda Pambianco, Stefano Marcugini

Publication date: 23 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.04.043

zbMATH Keywords

projective spacesNMDS codes\((n,3)\)-arcs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (7)

The complete (k, 3)-arcs of PG(2,q), q≤13 ⋮ On the Structure of Semiovals of Small Size ⋮ New classes of NMDS codes with dimension 3 ⋮ Maximal AMDS codes ⋮ On the minimum size of complete arcs and minimal saturating sets in projective planes ⋮ A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\) ⋮ The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
• An orderly algorithm and some applications in finite geometry
• Maximal \((n,3)\)-arcs in PG(2,11)
• On near-MDS codes
• Multiple Blocking Sets and Arcs in Finite Planes
• Maximum distance<tex>q</tex>-nary codes

This page was built for publication: Maximal (\(n\),3)-arcs in PG(2,13)