The minimum codeword length and redundancy in the binary Huffman code for uncertain sources (Q3484770)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum codeword length and redundancy in the binary Huffman code for uncertain sources |
scientific article |
Statements
The minimum codeword length and redundancy in the binary Huffman code for uncertain sources (English)
0 references
1990
0 references
uncertain sources
0 references
shortest codeword
0 references
binary Huffman code
0 references
probability distribution
0 references
lower bounds
0 references
redundancy
0 references
