scientific article; zbMATH DE number 1409223
From MaRDI portal
Publication:4940063
Recommendations
Cited in
(12)- The packing problem in statistics, coding theory and finite projective spaces
- Complete \((k,4)\)-arcs from quintic curves
- A new lower bound for the smallest complete \((k,n)\)-arc in \(\mathrm{PG}(2,q)\)
- Classical arcs in PG\((r,q)\) for \(23\leq q\leq 29\)
- New types of estimates for the smallest size of complete arcs in a finite Desarguesian projective plane
- Upper bounds on the smallest size of a complete arc in \(\mathrm{PG}(2, {q})\) under a certain probabilistic conjecture
- On the minimum size of complete arcs and minimal saturating sets in projective planes
- Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search
- The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
- A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
- The complete arcs in some of the projective plane
- Complete arcs in \(PG(2,25)\): The spectrum of the sizes and the classification of the smallest complete arcs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940063)