Lower Bounds for Binary Codes of Covering Radius One

Let K(n, l) denote the minimal cardinality of a binary code of length n and covering radius one. Blass and Litsyn proved a lower bound K(n, l) for in the case n equiv 5 (mod6). We give a simplification of the proof, which yields a slightly better result.