Minimum distance bounds for linear codes over GF(11)

Source abstract

Let $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q)$. One of the most important problems in coding theory is to construct codes with best possible minimum distances. In this paper 36 new cyclic and quasi-cyclic (QC) codes over GF(11) are presented and the table from [4] is enlarged by adding three new dimensions. Accepted: 20 September 2025