The smallest size of a complete cap in PG(3,\,7)
A cap of a projective space is a set of points no three of which are collinear. A cap is called complete if it is not properly contained in another cap. In the paper under review the authors show that 17 is the minimal size of a complete cap in the projective space \(\text{ PG}(3,7)\). They also show that -- up to projective equivalence -- there are 4 caps in \(\text{ PG}(3,7)\) of this size. Along the way, they also show that there exists no \([15,4,11]_7\)-code. This is a linear code of dimension 4 over the field \(\text{GF}(7)\) with minimal distance 11 between the codewords.
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\)
- Conjectural upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N\geq 3\)
- On the size of complete caps in PG\((3,2^{h}\))
- New upper bounds on the smallest size of a complete cap in the space \(\mathrm{PG}(3,q)\)
- The sizes \(k\) of the complete \(k\)-caps in \(PG(n,q)\), for small \(q\) and \(3\leq n \leq 5\)
- Small complete caps in PG(r,q), r 3
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(N,q)\), \(N \geq 3\), under a certain probabilistic conjecture
- On the size of a cap in \(\text{PG} (n,q)\) with \(q\) even and \(n\geq 3\)
- New upper bounds on the smallest size of a complete cap in the spaces \(\mathrm{PG}(3,q)\) and \(\mathrm{PG}(4,q)\).
- Small complete caps in PG(N, q), q even
- Almost MDS codes
- Classification of the (n,3)-arcs in PG(2,7)
- Codes of small defect
- Combinatorial Relations and Chromatic Graphs
- Computer search for small complete caps
- scientific article; zbMATH DE number 193020 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 2154136 (Why is no real title available?)
- On near-MDS codes
- The Geometry of Two-Weight Codes
- Complete \((q^2+q+8)/2\)-caps in the spaces \(\mathrm{PG}(3,q)\), \(q\equiv 2 \pmod 3\) an odd prime, and a complete 20-cap in \(\mathrm{PG}(3,5)\)
- On sizes of complete caps in projective spaces \(\mathrm{PG}(n, q)\) and arcs in planes \(\mathrm{PG}(2, q)\)
- Upper bounds on the smallest size of a complete cap in \(\mathrm{PG}(3, q)\) and \(\mathrm{PG}(4, q)\)
- Small complete caps in three-dimensional Galois spaces
- New quantum caps in \(\mathrm{PG}(4, 4)\)
- The minimum order of complete caps in \(PG(4,4)\)
- Small complete caps in Galois affine spaces
This page was built for publication: The smallest size of a complete cap in PG(3,\,7)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497464)
