Skip to main content
SpringerLink
Log in

A Family of Complete Caps in PG (n, 2)

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

An Erratum to this article was published on 01 May 2006

Abstract

We give a combinatorial construction of a one-parameter and a two-parameter family of complete caps in finite projective spaces over GF(2). As an application of our construction we find, for each α ε[1.89,2], a sequence of complete caps in PG(n,2) whose sizes grow roughly as αn. We also discuss the relevance of our caps to the problem of finding the least dependent caps of a given cardinality in a given dimension.

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

Access this article

Log in via an institution

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

  • AA Bruen L Haddad DL 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 Occurrence Handle99i:94062

    Article  MathSciNet  Google Scholar 

  • AA Bruen D Wehlau (1999) ArticleTitleLong binary linear codes and large caps in projective space Designs, Codes and Cryptography 17 IssueID1-3 37–60 Occurrence Handle2001a:94036

    MathSciNet  Google Scholar 

  • H Chen AS Hedayat (1996) ArticleTitle2n-l designs with weak minimum aberration Annals of Statistics 24 IssueID6 2536–2548 Occurrence Handle97k:62161

    MathSciNet  Google Scholar 

  • WE Clark J Pedersen (1992) ArticleTitleSum-free sets in vector spaces over GF(2) Journal of Combinatorial Theory Series A 61 IssueID2 222–229 Occurrence Handle93h:11139

    MathSciNet  Google Scholar 

  • AA Davydov LM Tombak (1991) ArticleTitleAn alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory IEEE Transactions on Information Theory 37 IssueID3 897–902 Occurrence Handle10.1109/18.79958 Occurrence Handle92b:94039

    Article  MathSciNet  Google Scholar 

  • 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-2 84–98 Occurrence Handle10.1007/BF01237602 Occurrence Handle2000c:51008

    Article  MathSciNet  Google Scholar 

  • J Fugè L Haddad D Wehlau (1994) ArticleTitle5-chromatic Steiner triple systems Journal of Combinatorial Designs 2 IssueID5 287–299 Occurrence Handle95d:05022

    MathSciNet  Google Scholar 

  • EM Gabidulin AA Davydov LM Tombak (1991) ArticleTitleLinear codes with covering radius 2 and other new covering codes IEEE Transactions on Information Theory 37 IssueID1 219–224 Occurrence Handle10.1109/18.61146 Occurrence Handle1087912

    Article  MathSciNet  Google Scholar 

  • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada

    Petr Lisoněk & Mahadad Khatirinejad

Authors
  1. Petr Lisoněk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahadad Khatirinejad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petr Lisoněk.

Additional information

*Research partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC).

An erratum to this article is available at http://dx.doi.org/10.1007/s10623-006-7835-1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisoněk, P., Khatirinejad, M. A Family of Complete Caps in PG (n, 2). Des Codes Crypt 35, 259–270 (2005). https://doi.org/10.1007/s10623-003-6737-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-003-6737-8

Keywords

Search

Navigation