During the last two decades the fundamental geometric parameter ofa block code, called covering radius, has been widely studied. In thispaper we estimate this parameter for linear codes with the aid of theminimum distance of the dual code. We derive a new bound on coveringradius which improves essentially on the known bounds in a wide range ofnormalized dual distances
展开▼
