The minimum codeword length and redundancy in the binary Huffman code for uncertain sources (Q3484770)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The minimum codeword length and redundancy in the binary Huffman code for uncertain sources |
scientific article; zbMATH DE number 4156369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum codeword length and redundancy in the binary Huffman code for uncertain sources |
scientific article; zbMATH DE number 4156369 |
Statements
The minimum codeword length and redundancy in the binary Huffman code for uncertain sources (English)
0 references
1990
0 references
uncertain sources
0 references
shortest codeword
0 references
binary Huffman code
0 references
probability distribution
0 references
lower bounds
0 references
redundancy
0 references
0.9055923223495485
0 references
0.9004012942314148
0 references
0.8904478549957275
0 references
0.8841671943664551
0 references
0.8836794495582581
0 references
