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.
Unable to display preview. Download preview PDF.
- F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.Google Scholar