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.
Data Structure Information Theory Projective Space Discrete Mathematic Data Encryption
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access