Lower bounds for \(q\)-ary codes with large covering radius (Q2380299)

Let \(K_q(n,R)\) denote the minimum possible size of a \(q\)-ary code of length \(n\) and covering radius \(R\). In the paper under review, the authors extend their previous approach for obtaining lower bounds on \(K_q(n,R)\) by use of partition matrices and their transversals. This generalization allows a number of improvements of the best bounds known so far. New bounds are presented in several tables.