New bounds on the redundancy of Huffman codes (Q3360786)
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 4213906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds on the redundancy of Huffman codes |
scientific article; zbMATH DE number 4213906 |
Statements
New bounds on the redundancy of Huffman codes (English)
0 references
1991
0 references
redundancy
0 references
Upper and lower bounds
0 references
binary Huffman codes
0 references
memoryless source
0 references
0.9644649624824524
0 references
0.959877908229828
0 references
0.9579872488975524
0 references
0.9525425434112548
0 references
