Tight bounds on the redundancy of Huffman codes (Q3991400): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:13, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds on the redundancy of Huffman codes |
scientific article |
Statements
Tight bounds on the redundancy of Huffman codes (English)
0 references
28 June 1992
0 references
upper bounds
0 references
redundancy
0 references
binary Huffman codes
0 references
lower bound
0 references
\(D\)-ary Huffman codes
0 references
