✦ LIBER ✦

On the Covering Radius of Long 5-ary BCH Codes with Minimum Distance 7

✍ Scribed by Y. Kaipainen; K. Suominen

Publisher: Springer
Year: 1997
Tongue: English
Weight: 254 KB
Volume: 8
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s002000050078

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the covering radius of long binary BC

On the covering radius of long binary BCH codes

✍ A Tietäinen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Upper Bounds on the Covering Radius of a

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

✍ 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 .