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

DOI10.1016/S0012-365X(99)00202-2zbMath0939.51017WikidataQ127125080 ScholiaQ127125080MaRDI QIDQ1808807

Stefano Marcugini, Fernanda Pambianco, Alfredo Milani

Publication date: 25 November 1999

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

zbMATH Keywords

\((n,3)\)-arc

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21)

Related Items (9)

The complete (k, 3)-arcs of PG(2,q), q≤13 ⋮ Near MDS codes of non-elliptic-curve type from Reed-Solomon codes ⋮ New classes of NMDS codes with dimension 3 ⋮ Maximal AMDS codes ⋮ Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\) ⋮ 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)\) ⋮ Maximal (\(n\),3)-arcs in PG(2,13) ⋮ Bounds on \((n,r)\)-arcs and their application to linear codes

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