Maximal (n,3)-arcs in PG(2,11)
From MaRDI portal
In a projective plane an \((n,r)\)-arc is a set of \(n\) points, no \((n+1)\) of which are collinear. This generalizes the idea of an \(n\)-arc -- a set of \(n\) points, no three of which are collinear. An \((n,r)\)-arc is complete if it is not included in an \((n+1,r)\)-arc. By a computer based search exploiting the fact that an \((n,3)\)-arc with \(n\geq 21\) contains an arc of size 7, the authors show that the largest size of an \((n,3)\)-arc in \(PG(2,11)\) is 21.
Recommendations
Cited in
(16)- A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
- A new \((37, 3)\)-arc in \(\mathrm{PG}(2,23)\)
- New (k;r)-arcs in the projective plane of order thirteen
- Maximal (n,4)-arcs in the projective plane of order 11
- The non-existence of some NMDS codes and the extremal sizes of complete \((n,3)\)-arcs in \(\mathrm{PG}(2,16)\)
- Maximal AMDS codes
- Bounds on (n,r)-arcs and their application to linear codes
- The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
- scientific article; zbMATH DE number 1189006 (Why is no real title available?)
- scientific article; zbMATH DE number 2065945 (Why is no real title available?)
- Maximal (\(n\),3)-arcs in PG(2,13)
- A note on putative (101,10)-arcs in \(\mathrm{PG}(2,11)\)
- Near MDS codes of non-elliptic-curve type from Reed-Solomon codes
- New classes of NMDS codes with dimension 3
- Near-MDS codes from maximal arcs in \(\mathrm{PG}(2,q)\)
- Four new families of NMDS codes with dimension 4 and their applications
This page was built for publication: Maximal \((n,3)\)-arcs in PG(2,11)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808807)
