New bounds on the redundancy of Huffman codes

DOI10.1109/18.87001zbMATH Open0733.94009OpenAlexW4255350051MaRDI QIDQ3360786FDOQ3360786

Authors: Renato M. Capocelli, Alfredo De Santis 

Publication date: 1991

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.87001

Recommendations

• Tight upper bounds on the redundancy of Huffman codes
• Bounds on the redundancy of Huffman codes (Corresp.)
• Tight bounds on the redundancy of Huffman codes
• scientific article; zbMATH DE number 4210045
• On the redundancy of binary Huffman codes (Corresp.)

zbMATH Keywords

redundancyUpper and lower boundsmemoryless sourcebinary Huffman codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Bounds on codes (94B65)

Cited In (12)

• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• Exact and Experimental Algorithms for a Huffman-Based Error Detecting Code
• Is Huffmann coding dead?
• Redundancy-Related Bounds for Generalized Huffman Codes
• Optimal binary search trees
• A fast algorithm for adaptive prefix coding
• On the redundancy of binary Huffman codes (Corresp.)
• Title not available (Why is that?)
• Bounds on the redundancy of Huffman codes (Corresp.)
• On the redundancy achieved by Huffman codes
• A simple upper bound on the redundancy of Huffman codes
• Tight upper bounds on the redundancy of Huffman codes

This page was built for publication: New bounds on the redundancy of Huffman codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360786)