Two strongly seminormal codes over Z(5) are constructed to prove a conjecture of Ostergard. It is shown that a result of Honkala on (k, t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper hound on K-q(n, R), the minimal, cardinality of a q-ary code of length n with covering radius R are obtained. These give improvements in seven upper hounds and twelve lower bounds by Ostergard for K-q(n, R) for q = 3, 4, and 5.