The smallest size of a complete cap in PG (3, 7)
Document Type
Article
Publication Date
7-6-2006
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. © 2006 Elsevier B.V. All rights reserved.
Publication Title
Discrete Mathematics
Recommended Citation
Bierbrauer, J.,
Marcugini, S.,
&
Pambianco, F.
(2006).
The smallest size of a complete cap in PG (3, 7).
Discrete Mathematics,
306(13), 1257-1263.
http://doi.org/10.1016/j.disc.2005.06.039
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/6281
COinS