A remark on Haas' method
The minimum cardinality of a binary code of length \(n\) and covering radius \(R\) is denoted by \(K(n,R)\). The author refines a method by \textit{W. Haas} [Discrete Math. 256, No. 1--2, 161--178 (2002; Zbl 1013.94039)] for obtaining lower bounds on \(K(n,1)\). The results include one specific new bound, \(K(27,1) \geq 4794174\).
scientific article; zbMATH DE number 5569078