Classification and Constructions of Complete Caps in Binary Spaces

Author: Khatirinejad Mahdad   Lisoněk Petr  

Publisher: Springer Publishing Company

ISSN: 0925-1022

Source: Designs, Codes and Cryptography, Vol.39, Iss.1, 2006-04, pp. : 17-31

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

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.