Classification and Constructions of Complete Caps in Binary Spaces

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. 1 Definitions and Known Results Let F2 denote the field with two elements and let Fr 2 denote the r-dimensional vector space over F2 with the standard inner product. Let PG(n, 2) denote Research partially supported by the Natural Sciences and Engineering Research Council of Canada (NSERC). 1 Manuscript Click here to download Manuscript: DESI10-revised-manuscript.tex 

• Type: Conference
• Year: 2006
• Where: DCC
• Authors: Mahdad Khatirinejad, Petr Lisonek
• Keywords: Complete Caps, Computer Graphics, DCC 2006, Denote Research, Standard Inner Product