No label defined (Q4945067)

An \([n, k, d]_q\)-code is a \(k\)-dimensional subspace of \(\mathbb{F}_q^n\) (where \(\mathbb{F}_q\) is the finite field with \(q\) elements) and of minimum distance \(d\). Fixing two of the three parameters \(n, k\) and \(d\) one can ask what is the optimal value for the third parameter. The authors discuss different kinds of optimality and give a survey of construction of optimal codes. The paper first contains a discussion of codes which are optimal with respect to the Griesmer bound. Thereafter some recent constructions based on the interrelation between codes and projective multisets are presented. Finally a discussion of optimal quasi-cyclic codes are given. This class of codes contains many of the optimal codes that have been found. For the entire collection see [Zbl 0933.00056].