On the redundancy achieved by Huffman codes
From MaRDI portal
Publication:1364502
DOI10.1016/0020-0255(95)00220-0zbMath0874.94020OpenAlexW1510013050MaRDI QIDQ1364502
Alfredo De Santis, Roberto De Prisco
Publication date: 4 September 1997
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(95)00220-0
Related Items
Cites Work
- Unnamed Item
- On the redundancy achieved by Huffman codes
- On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
- New bounds on the redundancy of Huffman codes
- Bounds on the redundancy of Huffman codes (Corresp.)
- On the average codeword length of optimal binary codes for extended sources (Corresp.)
- On the redundancy of binary Huffman codes (Corresp.)
- Tight bounds on the redundancy of Huffman codes
- Huffman codes and self-information
- An improved bound for weight-balanced tree
- Variations on a theme by Huffman
- Tight upper bounds on the redundancy of Huffman codes
- A Method for the Construction of Minimum-Redundancy Codes
