Abstract
We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We report results of the exhaustive classification (up to projective equivalence) of all caps in PG(n,2) for n≤ 6.
Similar content being viewed by others
References
A. Brouwer A. A. Bruen D. L. Wehlau (1996) ArticleTitleThere exist caps which block all spaces of fixed codimension in PG(n,2) J. Combin. Theory Ser. A 73 IssueID1 168–169 Occurrence Handle10.1006/jcta.1996.0010 Occurrence Handle96m:51015
A. A. Bruen L. Haddad D. L. Wehlau (1998) ArticleTitleBinary codes and caps J. Combin. Des. 6 IssueID4 275–284 Occurrence Handle10.1002/(SICI)1520-6610(1998)6:4<275::AID-JCD5>3.0.CO;2-C Occurrence Handle99i:94062
A. A. Bruen D. L. Wehlau (2001) ArticleTitleNew codes from old; a new geometric construction J. Combin. Theory Ser. A 94 IssueID1 196–202 Occurrence Handle10.1006/jcta.2000.3143 Occurrence Handle2002b:94045
H. Chen A. S. Hedayat (1996) ArticleTitle2n-l designs with weak minimum aberration Ann. Stat. 24 IssueID6 2536–2548 Occurrence Handle97k:62161
J. Chen D. X. Sun C. F. J. Wu (1993) ArticleTitleA catalogue of two-level and three-level fractional factorial designs with small runs Int. Stat. Rev. 61 131–145
W. E. Clark J. Pedersen (1992) ArticleTitleSum-free sets in vector spaces over GF (2) J. Combin. Theory Ser. A 61 IssueID2 222–229 Occurrence Handle93h:11139
A. A. Davydov L. M. Tombak (1988) ArticleTitleThe number of words of minimal weight in block codes Problems Inform. Transmission 24 IssueID1 7–18 Occurrence Handle89m:94018
A. A. Davydov L. M. Tombak (1989) ArticleTitleQuasiperfect linear binary codes with distance 4 and complete caps in projective geometry Problems Inform. Transmission 25 IssueID4 265–275 Occurrence Handle91a:94028
A. A. Davydov L. M. Tombak (1991) ArticleTitleAn alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory IEEE Trans. Inform. Theory 37 IssueID3 897–902 Occurrence Handle10.1109/18.79958 Occurrence Handle92b:94039
J. Fugère L. Haddad D. Wehlau (1994) ArticleTitle5-chromatic Steiner triple systems J. Combin. Des. 2 IssueID5 287–299 Occurrence Handle95d:05022
E. M. Gabidulin A. A. Davydov L. M. Tombak (1991) ArticleTitleLinear codes with covering radius 2 and other new covering codes IEEE Trans. Inform. Theory 37 IssueID1 219–224 Occurrence Handle10.1109/18.61146 Occurrence Handle1087912
J. J. E. Imber D. L. Wehlau (2003) ArticleTitleA family of small complete caps in \(\mathbb{PG}(n,2)\) European J. Combin. 24 IssueID6 613–615 Occurrence Handle10.1016/S0195-6698(03)00067-2 Occurrence Handle2004m:51030
A. Kerber (1999) Applied Finite Group Actions Springer-Verlag Berlin
P. Lisoněk M. Khatirinejad (2005) ArticleTitleA family of complete caps in PG(n,2) Des. Codes Cryptogr. 35 259–270 Occurrence Handle2150862
B. D. McKay, nauty User’s Guide. Technical Report TR-CS-90-02, Department of Computer Science, Australian National University, 1990.
G. F. Royle (1998) ArticleTitleAn orderly algorithm and some applications in finite geometry Discrete Math. 185 IssueID1–3 105–115 Occurrence Handle0956.68148 Occurrence Handle99c:51013
D. J. Street, Factorial Designs. In The CRC Handbook of Combinatorial Designs. (C. J. Colbourn and J. H. Dinitz, eds.) CRC Press, Boca Raton (1996).
D. L. Wehlau (2001) Complete caps in projective space which are disjoint from a subspace of codimension two A. Blokhuis J. W. P. Hirschfeld D. Jungnickel J. A. Thas (Eds) Finite Geometries Kluwer Academic Publishing Dordrecht 347–361
C. F. J. Wu M. Hamada (2000) Experiments. Planning, Analysis, and Parameter Design Optimization John Wiley & Sons New York
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: J. Hirschfeld
Research partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC)
Rights and permissions
About this article
Cite this article
Khatirinejad, M., Lisoněk, P. Classification and Constructions of Complete Caps in Binary Spaces. Des Codes Crypt 39, 17–31 (2006). https://doi.org/10.1007/s10623-005-2140-y
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-005-2140-y
Keywords
- Caps
- complete caps
- Galois geometries
- binary linear codes
- fractional fractorial designs
- isomorph-free generation