✦ LIBER ✦

All binary codes with covering radius one are subnormal

✍ Scribed by Iiro Honkala

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 300 KB
Volume: 94
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90028-z

No coin nor oath required. For personal study only.

✦ Synopsis

Honkla, I., All binary codes with covering radius one are subnormal, Discrete Mathematics 94 (1991) 229-232.

We prove that if a binary code hat; covering radius one then it is subnormal.

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