Tight upper bounds on the redundancy of Huffman codes (Q4733830)
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 4120122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight upper bounds on the redundancy of Huffman codes |
scientific article; zbMATH DE number 4120122 |
Statements
Tight upper bounds on the redundancy of Huffman codes (English)
0 references
1989
0 references
redundancy of Huffman codes
0 references
0.9785611033439636
0 references
0.9683446884155272
0 references
0.964607298374176
0 references
0.9644649624824524
0 references
0.9538484215736388
0 references
