论文信息 - A Family of Complete Caps in PG (n, 2)

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

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.

Petr Lisonek | Mahdad Khatirinejad

[1] Lucien Haddad,et al. 5‐chromatic steiner triple systems , 1994 .

[2] Aiden A. Bruen,et al. Long Binary Linear Codes and Large Caps in Projective Space , 1999, Des. Codes Cryptogr..

[3] W. Edwin Clark,et al. Sum-Free Sets in Vector Spaces over GF(2) , 1992, J. Comb. Theory, Ser. A.

[4] Alexander A. Davydov,et al. An alternative to the Hamming code in the class of SEC-DED codes in semiconductor memory , 1991, IEEE Trans. Inf. Theory.

[5] Ernst M. Gabidulin,et al. Linear codes with covering radius 2 and other new covering codes , 1991, IEEE Trans. Inf. Theory.

[6] A. Bruen,et al. Binary codes and caps , 1998 .

[7] Fernanda Pambianco,et al. On the spectrum of the valuesk for which a completek- cap in PG(n, q) exists , 1998 .

[8] A. S. Hedayat,et al. 2n-l designs with weak minimum aberration , 1996 .

[9] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .