On optimal linear codes over \(\mathbb F_8\) (Q625406)

Let \(n_q(k, d)\) be the smallest integer \(n\) for which there exists an \([n,k,d]_q\) code for given \(q\), \(k\), \(d\). It is known that \(n_8(4, d)=\sum^3_{i=0} \lceil d/8^i\rceil\) for all \(d\geq 833\). As a continuation of \textit{C. Jones}, \textit{A. Matney} and \textit{H. Ward} [Electron. J. Comb. 13, No. 1, Research paper R43, 21 p. (2006; Zbl 1165.94328)], we determine \(n_8(4, d)\) for \(117\) values of \(d\) with \(1\leq d\leq 832\) and give upper and lower bounds on \(n_8(4, d)\) for other \(d\) using geometric methods and some extension theorems for linear codes.