An improved lower bound on the covering number \(K_2(9,1)\) (Q1292854)

Here the authors improve the lower bound for \(K_2(9,1)\), the minimum cardinality of a binary code of length 9 and covering radius 1 in showing that a binary code of length 9, 55 codewords and covering radius 1 does not exist giving the new lower bound \(K_2(9,1)\geq 56\). In a later paper they obtain the bound 57 (see the following review Zbl 0933.94040). The best upper bound \(K(9)\leq 62\) has been obtained by L. T. Wille.