Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Constructions of Small Complete Caps in Binary Projective Spaces

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

Abstract

In the binary projective spaces PG(n,2) k-caps are called large if k > 2n-1 and smallif k ≤ 2n-1. In this paper we propose new constructions producing infinite families of small binary complete caps.

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.A. Bruen L. Haddad D.L. Wehlau (1998) ArticleTitleBinary codes and caps Journal of Combinatorial Designs. 6 IssueID4 275–284 Occurrence Handle10.1002/(SICI)1520-6610(1998)6:4<275::AID-JCD5>3.0.CO;2-C

    Article  Google Scholar 

  2. A.A. Bruen D.L. Wehlau (1999) ArticleTitleLong binary linear codes and large caps in projective space Designs, Codes and Cryptography. 17 IssueID1 37–60

    Google Scholar 

  3. A.A. Bruen D.L. Wehlau (2001) ArticleTitleNew codes from Old; a new geometric construction Journal of Combinatorial Theory, Series A. 94 IssueID2 196–202

    Google Scholar 

  4. W.E. Clark J. Pedersen (1992) ArticleTitleSum-free sets in vector spaces over GF(2) Journal of Combinatorial Theory, Series A. 61 IssueID2 222–229

    Google Scholar 

  5. A.A. Davydov L.M. Tombak (1989) ArticleTitleQuasi-perfect linear binary codes with distance 4 and complete caps in projective geometry Problems of Information Transmission. 25 IssueID4 265–275

    Google Scholar 

  6. A.A. Davydov S. Marcugini F. Pambianco (2004) ArticleTitleComplete caps in projective spaces PG(n, q) Journal of Geometry. 80 23–30 Occurrence Handle10.1007/s00022-004-1778-3

    Article  Google Scholar 

  7. G. Faina S. Marcugini A. Milani F. Pambianco (1998) ArticleTitleThe sizes k of the complete k-caps in PG(n, q), for small q and 3 ≤ n ≤ 5 Ars Combinatoria. 50 235–243

    Google Scholar 

  8. G. Faina F. Pambianco (1998) ArticleTitleOn the spectrum of the values k for which a complete k-cap in PG(n, q) exists Journal of Geometry. 62 IssueID1 84–98 Occurrence Handle10.1007/BF01237602

    Article  Google Scholar 

  9. E.M. Gabidulin A.A. Davydov L.M. Tombak (1991) ArticleTitleCodes with covering radius 2 and other new covering codes IEEE Transactions on Information Theory. 37 IssueID1 219–224 Occurrence Handle10.1109/18.61146

    Article  Google Scholar 

  10. J.W.P. Hirschfeld (1998) Projective Geometries over Finite Fields EditionNumber2 Clarendon Oxford

    Google Scholar 

  11. J.W.P. Hirschfeld L. Storme (2001) The packing problem in statistics, coding theory, and finite projective spaces: update 2001 A. Blokhuis J.W.P. Hirschfeld D. Jungnickel J.A. Thas (Eds) Developments in Mathematics, Vol. 3, Finite Geometries. Kluwer Academic Publishers Dordrecht 201–246

    Google Scholar 

  12. MacWilliams F.J., Sloane N.J.A. (1977). The Theory of Error-Correcting Codes, Part I. North-Holland, Amsterdam

  13. T. Szönyi (1985) ArticleTitleSmall complete arcs in Galois planes Geometriae Dedicata. 18 161–172

    Google Scholar 

  14. D.L. Wehlau (2001) Complete caps in projective space which are disjoint from a codimension 2 subspace A. Blokhuis J.W.P. Hirschfeld D. Jungnickel J.A. Thas (Eds) Developments in Mathematics, Vol. 3, Finite Geometries. Kluwer Academic Publishers Dordrecht 347–361

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, Russian Academy of Sciences, Bol’shoi Karetnyi per. 19, GSP-4, Moscow, 127994, Russia

    Alexander A. Davydov

  2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli 1, Perugia, 06123, Italy

    Giorgio Faina & Fernanda Pambianco

Authors
  1. Alexander A. Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Faina
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernanda Pambianco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander A. Davydov.

Additional information

Communicated by: J. W. P. Hirschfeld

AMS Classification: 51E21, 51E22, 94B05

Rights and permissions

Reprints and permissions

About this article

Cite this article

Davydov, A.A., Faina, G. & Pambianco, F. Constructions of Small Complete Caps in Binary Projective Spaces. Des Codes Crypt 37, 61–80 (2005). https://doi.org/10.1007/s10623-004-3805-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-004-3805-7

Keywords

Search

Navigation