Quasi-twisted codes over \(\mathbb {F}_{11}\) (Q2918603)

Given positive integers \(k\leq n\) and a prime power \(q\), the number \(d_q(n,k)\) is defined as the largest value of \(d\) for which there exists an \([n,k,d]\) linear code over \(\mathbb {F}_q\). A code achieving this minimum distance is called optimal.NEWLINENEWLINEIn this article, the author addresses the problem of finding optimal codes over the field \(\mathbb {F}_{11}\). Using the class of quasi-twisted codes, lower bounds on \(d_q(n,k)\) are obtained in the range \(k\leq 7\). Some of the constructed codes meet the Griesmer bound and are therefore optimal.