Although this site was up over 25 years it now soon will be shut down due to administrative reasons.
It will be further available on my new home page www.yvesedel.de

On Multiple Caps in Finite Projective Spaces

Designs, Codes and Cryptography, 56 No. 2-3 (2010), 163-175.

doi:10.1007/s10623-010-9398-4

---

Abstract:

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,2)-caps to caps with larger n. We give explicit constructions for good caps with small n. In particular, we determine the largest size of a (k,3)-cap in PG(3,5), which turns out to be 44. The results on caps in PG(3,5) provide a solution to four of the eight open instances of the main coding theory problem for q=5 and k=4.

Download the preprint as pdf

| home | List of publications |