𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the size of optimal binary codes of length 9 and covering radius 1

✍ Scribed by Ostergard, P.R.J.; Blass, U.

Book ID
114542006
Publisher
IEEE
Year
2001
Tongue
English
Weight
78 KB
Volume
47
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal binary covering codes of length
Optimal binary covering codes of length 2j
✍ William D. Weakley πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

## Abstract The minimum size of a binary covering code of length __n__ and covering radius __r__ is denoted by __K__(__n__,__r__), and codes of this length are called optimal. For __j__ > 0 and __n__ = 2^__j__^, it is known that __K__(__n__,1) = 2 · __K__(__n__βˆ’1,1) = 2^__nβ€‰βˆ’β€‰j__^. Say that two bin