On multiple caps in finite projective spaces | Designs, Codes and Cryptography Skip to main content
Springer Nature Link
Log in

On multiple caps in finite projective spaces

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

Abstract

In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k, 2)-caps to caps with larger n. We give explicit constructions for good caps with small n. In particular, we determine the largest size of a (k, 3)-cap in PG(3, 5), which turns out to be 44. The results on caps in PG(3, 5) provide a solution to four of the eight open instances of the main coding theory problem for q = 5 and k = 4.

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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Boukliev I., Kapralov S., Maruta T., Fukui M.: Optimal quaternary linear codes of dimension five. IEEE Trans. Inform. Theory 43, 308–313 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bramwell D.L., Wilson B.J.: Cubic caps in three-dimensional Galois space. Proc. R. Irish Acad, A 73, 279–283 (1973)

    MATH  MathSciNet  Google Scholar 

  3. Edel Y., Bierbrauer J.: Recursive constructions for large caps. Bull. Belgian Math. Soc. - Simon Stevin 6, 249–258 (1999)

    MATH  MathSciNet  Google Scholar 

  4. Griesmer J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4, 532–542 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hill R.: Some results concerning linear codes and (k, 3)-caps in three-dimensional Galois space. Math. Proc. Camb. Philos. Soc. 84, 191–205 (1978)

    Article  MATH  Google Scholar 

  6. Hirschfeld J.W.P.: Projective Geometries over Finite Fields. Oxford University Press (1998).

  7. Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001, In: Blokhuis, A. et al. (eds.) Finite Geometries, pp. 201–246. Kluwer Academic Publishers (2001).

  8. Landjev I., Rousseva A., Maruta T., Hill R.: On optimal codes over the field with five elements. Des. Codes Cryptogr. 29, 165–175 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Maruta T., Shinohara M., Kikui A.: On optimal linear codes over \({\mathbb{F}_5}\). Discret. Math. 309, 1255–1272 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Pure Mathematics and Computer Algebra, Ghent University, Krijgslaan 281-S22, 9000, Ghent, Belgium

    Yves Edel

  2. New Bulgarian University, 21 Montevideo Str., 1618, Sofia, Bulgaria

    Ivan Landjev

  3. Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, 8 Acad. G. Bonchev, 1113, Sofia, Bulgaria

    Ivan Landjev

Authors
  1. Yves Edel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Landjev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Landjev.

Additional information

Communicated by L. Storme.

Dedicated to the memory of András Gács (1969–2009).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edel, Y., Landjev, I. On multiple caps in finite projective spaces. Des. Codes Cryptogr. 56, 163–175 (2010). https://doi.org/10.1007/s10623-010-9398-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-010-9398-4

Keywords

Mathematics Subject Classification (2000)

Search

Navigation