Upper bounds on the covering radius of codes with a given cardinality
and a given dual-distance width are derived. Using an entirely new met
hod, some previous results of Delorme and Sole for linear codes are ge
neralized and results are derived for unrestricted codes that have no
previous analogue. For some classes of codes, when the parameters lie
within certain intervals, results improve asymptotically on the recent
upper bounds of Tietavainen relating the covering radius with the dua
l distance.