30 search results - page 1 / 6 » Classification and Constructions of Complete Caps in Binary ... |
DCC
2006
IEEE
14 years 4 months ago
2006
IEEE
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 ...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
We obtain, in principle, a complete classification of all long inextendable binary linear codes. Several related constructions and results are presented.
DCC
2001
IEEE
14 years 4 months ago
2001
IEEE
We construct large caps in projective spaces of small dimension (up to 11) defined over fields of order at most 9. The constructions are both theoretical and computer-supported. S...
DCC
2010
IEEE
13 years 4 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
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 w...