A new bound for the data expansion of Huffman codes (Q4392409)
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 1160204
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new bound for the data expansion of Huffman codes |
scientific article; zbMATH DE number 1160204 |
Statements
A new bound for the data expansion of Huffman codes (English)
0 references
5 May 1999
0 references
redundancy of optimal codes
0 references
maximum data expansion
0 references
Huffman codes
0 references
0.8479341268539429
0 references
0.8130590915679932
0 references
0.8043583631515503
0 references
0.8018398284912109
0 references