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

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.