New upper and lower bounds on covering codes K_q(n,R) for alphabets of size 5 <= q <= 21

Mark Marosi

Let K_q(n,R) denote the minimum cardinality of a q-ary code of length n with covering radius R. We improve the known bounds on K_q(n,R) in 83 cases (82 distinct cells). On the uppe…