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

DOI10.1006/ffta.1996.9999zbMath0896.51008OpenAlexW2011588701MaRDI QIDQ1383492

Simeon Ball, Aart Blokhuis

Publication date: 26 April 1998

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1996.9999

zbMATH Keywords

double blocking setgenerating setlacunary polynomials

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21)

Related Items (16)

Three Combinatorial Perspectives on Minimal Codes ⋮ Blocking sets of almost Rédei type ⋮ Double blocking sets of size \(3 q - 1\) in \(\operatorname{PG}(2, q)\) ⋮ Combinatorial repairability for threshold schemes ⋮ Search problems in vector spaces ⋮ On the metric dimension of imprimitive distance-regular graphs ⋮ The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q) ⋮ Small weight codewords in the codes arising from Desarguesian projective planes ⋮ Algebraic curves and maximal arcs ⋮ Blocking sets in Desarguesian affine and projective planes ⋮ A geometric characterization of minimal codes and their asymptotic performance ⋮ On resolving sets in the point-line incidence graph of PG(n, q) ⋮ Bounds on \((n,r)\)-arcs and their application to linear codes ⋮ Translation hyperovals and \(\mathbb{F}_2\)-linear sets of pseudoregulus type ⋮ The packing problem in statistics, coding theory and finite projective spaces ⋮ The non-existence of certain large minimal blocking sets

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