On the Size of a Double Blocking Set in PG(2,q)

Authors:
Simeon Ball;Aart Blokhuis
Affiliations:
University of Sussex, Falmer, East Sussex, United Kingdom;Technical University Eindhoven, P.O. Box 513, 5600, MB Eindhoven, The Netherlands
Venue:
Finite Fields and Their Applications
Year:
1996

Citing 3
Cited 5

Arcs and blocking sets II

European Journal of Combinatorics
Polynomial multiplicities over finite fields and intersection sets

Journal of Combinatorial Theory Series A
The number of directions determined by a function f on a finite field

Journal of Combinatorial Theory Series A

Multiple Blocking Sets in PG(n, q), n 3

Designs, Codes and Cryptography
Small weight codewords in the codes arising from Desarguesian projective planes

Designs, Codes and Cryptography
Algebraic curves and maximal arcs

Journal of Algebraic Combinatorics: An International Journal
Blocking Sets in Desarguesian Affine and Projective Planes

Finite Fields and Their Applications
Bounds on (n,r)-arcs and their application to linear codes

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We obtain lower bounds for the size of a double blocking set in the Desarguesian projective planePG(2,q). These bounds are best possible forq