New lower bounds for multiple coverings
A code C subset of Z(2)(n), where Z(2) = {0, 1}, is said to be a binary mu-fold R-covering code, if for any word upsilon is an element of Z(2)(n) there are at least mu distinct codewords c. C which differ from v in at most R coordinates. The size of the smallest binary mu-fold R-covering code of length n is denoted by K( n, R, mu). In this paper we use integer programming and exhaustive search to improve 57 lower bounds on K( n, R, mu) for 6 <= n <= 16, 1 <= R <= 4 and 2 <= mu <= 4.
multiple coverings integer programming exhaustive search