On sharply transitive sets in \(\mathrm{PG}(2,g)\).

DOI10.2140/IIG.2008.6.139zbMath1178.51010OpenAlexW2473381345WikidataQ128363587 ScholiaQ128363587MaRDI QIDQ1022870

Fernanda Pambianco, Stefano Marcugini, Alexander A. Davydov, Massimo Giulietti

Publication date: 23 June 2009

Published in: Innovations in Incidence Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/iig.2008.6.139

zbMATH Keywords

intersection numberscomplete arcstransitive arcs

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21)

Related Items (7)

Upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane based on computer search ⋮ On the geometric constructions of optimal linear codes ⋮ Some combinatorial aspects of constructing bipartite-graph codes ⋮ New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane ⋮ On sizes of complete arcs in \(PG(2,q)\) ⋮ On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\) ⋮ 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: On sharply transitive sets in \(\mathrm{PG}(2,g)\).