On the minimum length of linear codes of dimension 5 (Q6658055)

Denote \(n_q(k,d)\) the minimum length \(n\) for which there exists a \([n,k,d]_q\) linear code. A code with \(n=n_q(k,d)\) is called length optimal, and finding such codes is an important task since they are at the same time also distance and dimension optimal. In this article, the authors aim to find 5-dimensional length optimal codes.\N\NThe Griesmer number is defined as \(g_q(k,d)=\sum\limits_{i=0}^{k-1}{\left\lceil\frac{d}{q^i}\right\rceil}.\) The authors have proved that when \(q\geq 5,\) \(n_q(5, d) = g_q(5, d) + 1\) for \(3q^4-4q^3-aq + 1 \leq d \leq 3q^4 - 4q^3\) for an integer \(a\) such that \(1 \leq a \leq \lceil\frac{2}{3}q + 1\rceil.\)\N\NFurthermore, again when \(g\geq 5,\) the same equation \(n_q(5, d) = g_q(5, d) + 1\) is proven for \(2q^4-2q^3-2q^2-q+1\leq d\leq 2q^4-2q^3-2q^2.\) As a result, using previous research on the nonexistence of Griesmer codes, the nonexistence of \([g_q(5, d), 5, d]_q\) codes for 9 different cases depending on minimal distance \(d\) and field sizes \(q\) is proven.