𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Binary codes with covering radius one: Some new lower bounds

✍ Scribed by Laurent Habsieger

Book ID
108316100
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
514 KB
Volume
176
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

All binary codes with covering radius on
All binary codes with covering radius one are subnormal
✍ Iiro Honkala πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 300 KB

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.

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 .