New quasi-cyclic degenerate linear codes over GF(8) (Q2487089)

Let \([n,k,d]_q\) code be a linear code with length \(n\), dimension \(k\), and minimum Hamming distance \(d\) over the Galois field with \(q\) elements -- GF\((q)\). One of the most important problems in coding theory is to find \(d_q(n,k)\), the largest value of \(d\) for which there exists an \([n,k,d]_q\) code. This is the reason to construct codes with best possible minimum distances. Recently, quasi-cyclic (\(QC\)) codes were proved to contain many such codes. In this paper, twenty-five new quasi-cyclic codes over GF(8) are constructed using a nonexhaustive algebraic-combinatorial computer search. These new codes improve the best known lower bounds on minimum distance.