The Renyi redundancy of generalized Huffman codes (Q3818256)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4089483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Renyi redundancy of generalized Huffman codes |
scientific article; zbMATH DE number 4089483 |
Statements
The Renyi redundancy of generalized Huffman codes (English)
0 references
1989
0 references
average codeword length, Huffman's algorithm
0 references
optimal codes
0 references
Shannon's entropy
0 references
noiseless source coding theorem
0 references
Gallager's bound on the redundancy of Huffman codes
0 references
0.8827883005142212
0 references
0.8815284371376038
0 references
0.8799006342887878
0 references
0.8760502934455872
0 references
