On the nonexistence of \(q\)-ary linear codes of dimension five (Q5929720)

One of the main problems in coding theory is to determine \(n_q (k,d)\), the minimum value of \(n\) for which there exists an \([n,k,d]_q\)-code for given \(q,k,d\). The main purpose of this paper is to prove that there do not exist \([n,5,d]\)-codes over the Galois field \(GF(q)\) attaining the Griesmer bound when \(d=q^4-2 q^2-q+1\), \(2q^4-2q^3 -q^2-q+1\) for \(q\geq 3\) and when \(d=3q^4 -4q^3-q+1\) for \(q\geq 5\).