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

Bit probabilities of optimal binary source codes

โœ Scribed by Montgomery, B.L.; Diamond, H.; Vijaya Kumar, B.V.K.

Book ID
114540689
Publisher
IEEE
Year
1990
Tongue
English
Weight
595 KB
Volume
36
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal binary prefix-condition codes wi
Optimal binary prefix-condition codes with ordinal probabilities
โœ Greenberg, Irwin ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 432 KB

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared

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