Computer search in projective planes for the sizes of complete arcs

DOI10.1007/s00022-004-1719-1zbMath1086.51011OpenAlexW2112765613MaRDI QIDQ2573749

Stefano Marcugini, Fernanda Pambianco, Alexander A. Davydov, Giorgio Faina

Publication date: 24 November 2005

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-004-1719-1

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Finite affine and projective planes (geometric aspects) (51E15) Linear codes and caps in Galois spaces (51E22) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (13)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ On Small Complete Arcs and Transitive A5-Invariant Arcs in the Projective Plane PG(2,q) ⋮ Small complete caps in Galois affine spaces ⋮ On saturating sets in projective spaces. ⋮ New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane ⋮ On the minimum size of complete arcs and minimal saturating sets in projective planes ⋮ On sizes of complete arcs in \(PG(2,q)\) ⋮ On arcs sharing the maximum number of points with ovals in cyclic affine planes of odd order ⋮ New inductive constructions of complete caps inPG(N, q),qeven ⋮ The Complete Arcs of PG(2,31) ⋮ On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\) ⋮ 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

This page was built for publication: Computer search in projective planes for the sizes of complete arcs