skip to main content
article

On the size of minimal blocking sets of Q(4; q), for q = 5,7

Published:01 September 2004Publication History
Skip Abstract Section

Abstract

Let Q(2n + 2; q) denote the non-singular parabolic quadric in the projective geometry PG(2n + 2; q). We describe the implementation in GAP of an algorithm to study the problem of the minimal number of points of a minimal blocking set, different from an ovoid, of Q(4; q), for q = 5; 7.

References

  1. A. Beutelspacher and U. Rosenbaum. Projective Geometry. Cambridge University Press, 1998.Google ScholarGoogle Scholar
  2. A. Blokhuis. On the size of a blocking set in PG(2; p). Combinatorica, 14(1):111--114, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  3. A. Blokhuis, L. Storme, and T. Szönyi. Lacunary polynomials, multiple blocking sets and Baer subplanes. J. London Math. Soc. (2), 60(2):321--332, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. A. Bruen. Baer subplanes and blocking sets. Bull. Amer. Math. Soc., 76:342--344, 1970.Google ScholarGoogle ScholarCross RefCross Ref
  5. F. Buekenhout and E. E. Shult. On the foundations of polar geometry. Geom. Dedicata, 3:155--170, 1974.Google ScholarGoogle ScholarCross RefCross Ref
  6. J. De Beule, P. Govaerts, and L. Storme. Projective Geometries, a share package for GAP. http://cage.ugent.be/~jdebeule/pgGoogle ScholarGoogle Scholar
  7. J. De Beule and L. Storme. The smallest minimal blocking sets of Q(6; q), q even. J. Combin. Des., 11(4):290--303, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. De Beule and L. Storme. On the smallest minimal blocking sets of Q(2n; q), for q an odd prime. Discrete Math., Proceedings of the First Irsee Conference on Finite Geometry (Irsee, 2003), to appear.Google ScholarGoogle Scholar
  9. J. Dittmann, A. Behr, M. Stabenau, P. Schmitt, J. Schwenk, and J. Ueberberg. Combining digital Watermarks and collusion secure Fingerprints for digital Images. http://www.ipsi.fraunhofer.de/~dittmann/pdf/spie-dittmann.pdfGoogle ScholarGoogle Scholar
  10. J. Eisfeld, L. Storme, T. Szönyi, and P. Sziklai. Covers and blocking sets of classical generalized quadrangles. Discrete Math., 238(1--3):35--51, 2001. Proceedings of The Third International Shanghai Conference on Designs, Codes and Finite Geometries (Shanghai, China, May 14--18, 1999). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. The GAP Group, GAP -- Groups, Algorithms, and Programming, Version 4.3; 2002. http://www.gap-system.orgGoogle ScholarGoogle Scholar
  12. J. W. P. Hirschfeld. Projective Geometries Over Finite Fields. The Clarendon Press, Oxford University Press, New York, second edition, 1998.Google ScholarGoogle Scholar
  13. J. W. P. Hirschfeld and J. A. Thas. General Galois Geometries. Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, 1991. Oxford Science Publications.Google ScholarGoogle Scholar
  14. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North-Holland, 1977.Google ScholarGoogle Scholar
  15. K. Metsch. Small point sets that meet all generators of W(2n+1; q). Des. Codes Cryptogr., to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. MOSIX. http://www.mosix.orgGoogle ScholarGoogle Scholar
  17. A. Pasini. Diagram Geometries. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1994.Google ScholarGoogle Scholar
  18. S. E. Payne and J. A. Thas. Finite Generalized Quadrangles. Pitman (Advanced Publishing Program), Boston, MA, 1984.Google ScholarGoogle Scholar
  19. J. A. Thas. Ovoids and spreads of finite classical polar spaces. Geom. Dedicata, 10(1--4):135--143, 1981.Google ScholarGoogle Scholar
  20. N. Thomas. Projective geometry. http://www.anth.org.uk/NCT/Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGSAM Bulletin
    ACM SIGSAM Bulletin  Volume 38, Issue 3
    September 2004
    51 pages
    ISSN:0163-5824
    DOI:10.1145/1040034
    Issue’s Table of Contents

    Copyright © 2004 Authors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 September 2004

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader