Upper Bounds on the Covering Radius of a
✍
S. Litsyn; A. Tietäväinen
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 235 KB
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 -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .