On the size of a triple blocking set in \(\text{PG} (2,q)\)

DOI10.1006/EUJC.1996.0036zbMath0858.51003OpenAlexW1981781899MaRDI QIDQ1922870

Simeon Ball

Publication date: 25 March 1997

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1996.0036

zbMATH Keywords

lacunary polynomials3-fold blocking sets

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Finite fields (field-theoretic aspects) (12E20)

Related Items (4)

A new upper bound for the largest complete \boldmath(𝑘,𝑛)-arc in \boldmath𝑃𝐺(2,𝑞) ⋮ Unnamed Item ⋮ Bounds on \((n,r)\)-arcs and their application to linear codes ⋮ The packing problem in statistics, coding theory and finite projective spaces

This page was built for publication: On the size of a triple blocking set in \(\text{PG} (2,q)\)