Some new lower bounds for binary and ternary covering codes

A modified lower bound for binary codes with covering radius one is derived. Let K/sub q/(n,R) denote the minimum cardinality of a q-ary code with covering radius R. The new bound shows that K/sub 2/(11,1)>or=177 and that K/sub 2/(17,1)>or=7391, improvements of the best lower bounds known. The authors also generalize a known lower bound for binary codes to the case of arbitrary q. For q=3, this simple bound improves the best lower bounds known in several cases. An updated version of a table for K/sub 3/(n,R) is included.<
>