... k = For k > the computational effort became too large for a systematical treatment Here we got only a few sporadic new bounds: six bounds for k = 6, two bounds for k = and still a new bound for ... [1] W Chen, I S Honkala, Lower bounds for q-ary covering codes, IEEE Trans Inform Theory 36 (1990), 664-671 [2] G Cohen, I Honkala, S Litsyn, A Lobstein, Covering Codes, North Holland, Amsterdam, ... Schlage-Puchta, Lower Bounds on Covering Codes via Partition Matrices, J Combin Theory Ser A 116 (2009), 478-484 [4] W Haas, J Quistorff, J.-C Schlage-Puchta, New Lower Bounds for Covering Codes, preprint...