New lower bounds for covering codes (Q5915413)

This paper is devoted to improving some of the best known lower bounds on \(K_q(n,R)\), the minimum size of a covering code with radius \(R\) on \(\mathbb{F}^n_q\). The authors develop two methods based on the notion of linear inequality of a code. Applying both methods, the authors improve 48 bounds compared to \textit{G. Cohen}, \textit{I. Honkala}, \textit{S. Litsyn} and \textit{A. Lobstein}, Covering Codes (North-Holland, Amsterdam) (1997; Zbl 0874.94001).