Complete caps in AG(3, q) from elliptic curves

In a three-dimensional Galois space of odd order q, the known infinite families of complete caps have size far from the theoretical lower bounds. In this paper, we investigate some caps defined from elliptic curves. In particular, we show that for each q between 100 and 350 they can be extended to complete caps, which turn out to be the smallest complete caps known in the literature.

A note on k-3 caps in three-dimensional Galois space

A k-3 cap in a three-dimensional Galois space, S3,q, is a set of k points, of which some 3, but no 4 are collinear. It is shown in (2) that for q ≥ 4 .

Some results concerning linear codes and (k, 3)-caps in three-dimensional Galois space

The packing problem for (k, 3)-caps is that of finding (m, 3)r, q, the largest size of (k, 3)-cap in the Galois space Sr, q. The problem is tackled by exploiting the interplay of finite geometries with error-correcting codes. An improved general upper bound on (m, 3)3 q and the actual value of (m, 3)3, 4 are obtained. In terms of coding theory, the methods make a useful contribution to the difficult task of establishing the existence or non-existence of linear codes with certain weight distributions.