Covering radius and dual distance

Recently a number of bounds have been obtained for the covering radius of a code with given length and cardinality. In this paper we show that—perhaps surprisingly—the covering radius of a code depends heavily on its dual distance. We consider an arbitrary finite Abelian group alphabet though in the applications the alphabet is very often the field F₂.