Skip to main content
Springer Nature Link
Log in

Extensions of Generalized Product Caps

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

Abstract

We give some variants of a new construction for caps. As an application of these constructions, we obtain a 1216-cap in PG(9,3) a 6464-cap in PG(11,3) and several caps in ternary affine spaces of larger dimension, which lead to better asymptotics than the caps constructed by Calderbank and Fishburn [1]. These asymptotic improvements become visible in dimensions as low as 62, whereas the bound from Calderbank and Fishburn [1] is based on caps in dimension 13,500.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. R. Calderbank and P. C. Fishburn, Maximal three-independent subsets of {0, 1, 2}n, Designs, Codes and Cryptography, Vol. 4 (1994) pp. 203-211.

    Google Scholar 

  2. Y. Edel and J. Bierbrauer, Recursive constructions for large caps, Bulletin of the Belgian Mathematical Society-Simon Stevin, Vol. 6 (1999) pp. 249-258.

    Google Scholar 

  3. Y. Edel and J. Bierbrauer, 41 is the largest size of a cap in PG(4; 4), Designs, Codes and Cryptography, Vol. 16 (1999) pp. 151-160.

    Google Scholar 

  4. Y. Edel and J. Bierbrauer, Large caps in small spaces, Designs, Codes and Cryptography, Vol. 23 (2001) pp. 197-212.

    Google Scholar 

  5. Y. Edel, S. Ferret, I. Landjev and L. Storme, The classification of the largest caps in AG(5; 3), Journal of Combinatorial Theory A, Vol. 99 (2002) pp. 95-110.

    Google Scholar 

  6. D. Glynn and T. T. Tatau, A 126-cap of PG(5; 4) and its corresponding [126,6,88]-code, Utilitas Mathematica, Vol. 55 (1999) pp. 201-210.

    Google Scholar 

  7. R. Hill, On the largest size of cap in S5;3, Atti Accad. Naz. Lincei Rendiconti, Vol. 54 (1973) pp. 378-384.

    Google Scholar 

  8. J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, Journal of Statistical Planning and Inference, Vol. 72 (1998) pp. 355-380.

    Google Scholar 

  9. J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces, Proceedings of the Fourth Isle of Thorns Conference (July 16-21, 2000) pp. 201-246.

  10. J. W. P. Hirschfeld and J. A. Thas, General Galois Geometries, Oxford University Press, Oxford (1991).

    Google Scholar 

  11. F. J. McWilliams and N. J. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977).

    Google Scholar 

  12. A. C. Mukhopadhyay, Lower bounds on mt(r; s), Journal of Combinatorial Theory A, Vol. 25 (1978) pp. 1-13.

    Google Scholar 

  13. G. Pellegrino, Sul massimo ordine delle calotte in S 4;3, Matematiche (Catania), Vol. 25 (1970) pp. 1-9.

    Google Scholar 

  14. B. Segre, Le geometrie di Galois, Ann. Mat. Pura Appl., Vol. 48 (1959) pp. 1-97.

    Google Scholar 

  15. Yves Edel's homepage: http://www.mathi.uni-heidelberg.de/~yves.

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität, Im Neuenheimer Feld 288, 69120, Heidelberg, Germany

    Yves Edel

Authors
  1. Yves Edel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edel, Y. Extensions of Generalized Product Caps. Designs, Codes and Cryptography 31, 5–14 (2004). https://doi.org/10.1023/A:1027365901231

Download citation

  • Issue Date:

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