Upper Bounds on the Covering Radius of a Code with a Given Dual Distance

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width. These bounds improve on the Delorme-Solé-Stokes bounds, and in a certain interval for binary linear codes they are also better than Tietنvنinenʹs bound.