The smallest size of a complete cap in PG (3, 7)

Document Type

Article

Publication Date

7-6-2006

Department

Department of Mathematical Sciences

Abstract

We show that 17 is the smallest size of a complete cap in the projective space PG (3, 7) and that there are exactly four projectively inequivalent such caps. Along the way it is shown that a linear code [15, 4, 11]7 does not exist.

Publication Title

Discrete Mathematics

Share

COinS