Skip to main content
Log in

On 1-Blocking Sets in PG(n,q), n ≥ 3

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In this article we study minimal1-blocking sets in finite projective spaces PG(n,q),n ≥ 3. We prove that in PG(n,q 2),q = p h, p prime, p > 3,h ≥ 1, the second smallest minimal 1-blockingsets are the second smallest minimal blocking sets, w.r.t.lines, in a plane of PG(n,q 2). We also study minimal1-blocking sets in PG(n,q 3), n ≥ 3, q = p h, p prime, p > 3,q ≠ 5, and prove that the minimal 1-blockingsets of cardinality at most q 3 + q 2 + q + 1 are eithera minimal blocking set in a plane or a subgeometry PG(3,q).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Beutelspacher, Blocking sets and partial spreads in finite projective spaces, Geom. Dedicata, Vol. 9 (1980) pp. 130–157.

    Google Scholar 

  2. A. Blokhuis, On the size of a blocking set in PG(2; p), Combinatorica, Vol. 14 (1994) pp. 111–114.

    Google Scholar 

  3. A. Blokhuis, S. Ball, A. Brouwer, L. Storme and T. Szönyi, On the number of slopes of the graph of a function defined on a finite field, J. Combin. Theory, Ser. A, Vol. 86 (1999) pp. 187–196.

    Google Scholar 

  4. A. Blokhuis, L. Storme and T. Szönyi, Lacunary polynomials, multiple blocking sets and Baer subplanes, J. London Math. Soc., Vol. 60 (1999), 321–332.

    Google Scholar 

  5. R. C. Bose and R. C. Burton, A characterization of flat spaces in a finite projective geometry and the uniqueness of the Hamming and the MacDonald codes, J. Combin. Theory, Vol. 1 (1966) pp. 96–104.

    Google Scholar 

  6. A. A. Bruen, Baer subplanes and blocking sets, Bull. Amer. Math. Soc., Vol. 76 (1970) pp. 342–344.

    Google Scholar 

  7. A. A. Bruen, Blocking sets and skew subspaces of projective space, Canad. J. Math., Vol. 32 (1980) pp. 628–630.

    Google Scholar 

  8. U. Heim, Proper blocking sets in projective spaces, Discrete Math., Vol. 174 (1997) pp. 167–176.

    Google Scholar 

  9. U. Heim, On t-blocking sets in projective spaces. (Preprint).

  10. J. W. P. Hirschfeld, Projective Geometries over Finite Fields (Second Edition), Oxford University Press, Oxford (1998).

    Google Scholar 

  11. G. Lunardon, Normal spreads, Geom. Dedicata, Vol. 75 (1999) pp. 245–261.

    Google Scholar 

  12. G. Lunardon, Linear k-blocking sets, Combinatorica, submitted.

  13. G. Lunardon, P. Polito and O. Polverino, A geometric characterisation of linear k-blocking sets. (Preprint).

  14. O. Polverino, Small blocking sets in PG(2; p 3), Des. Codes Cryptogr., to appear.

  15. O. Polverino and P. Polito, On small blocking sets, Combinatorica, Vol. 18 (1998) pp. 133–137.

    Google Scholar 

  16. O. Polverino and L. Storme, Minimal blocking sets in PG(2; q 3), Europ. J. Combin., submitted.

  17. O. Polverino, T. Szönyi and Zs. Weiner, Blocking sets in Galois planes of square order, Acta Sci. Math. (Szeged), Vol. 65 (1999) pp. 737–748.

    Google Scholar 

  18. T. Szönyi, Blocking sets in Desarguesian affine and projective planes, Finite Fields Appl., Vol. 3 (1997) pp. 187–202.

    Google Scholar 

  19. M. Sved, Baer subspaces in the n-dimensional projective space, Combinatorial Mathematics, X (Adelaide, 1982), pp. 375–391.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Storme, L., Weiner, Z. On 1-Blocking Sets in PG(n,q), n ≥ 3. Designs, Codes and Cryptography 21, 235–251 (2000). https://doi.org/10.1023/A:1008308200010

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008308200010

Navigation