A simple upper bound on the redundancy of Huffman codes (Q4677534)
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 2167254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple upper bound on the redundancy of Huffman codes |
scientific article; zbMATH DE number 2167254 |
Statements
A simple upper bound on the redundancy of Huffman codes (English)
0 references
11 May 2005
0 references
0.9409300088882446
0 references
0.9346405267715454
0 references
0.9332230687141418
0 references
0.9185246229171752
0 references
