Tight bounds on the redundancy of Huffman codes (Q3991400): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/18.108260 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2096900278 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 15:21, 19 March 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
