๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal binary vector quantization via enumeration of covering codes

โœ Scribed by Xiaolin Wu


Book ID
114540565
Publisher
IEEE
Year
1997
Tongue
English
Weight
216 KB
Volume
43
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimal binary covering codes of length
โœ 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