Redundancy-Related Bounds for Generalized Huffman Codes

DOI10.1109/TIT.2011.2110670zbMATH Open1366.94223OpenAlexW2144986988MaRDI QIDQ5280988FDOQ5280988

Authors: Michael B. Baer 

Publication date: 27 July 2017

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

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

Recommendations

• Bounds on the redundancy of Huffman codes (Corresp.)
• The Renyi redundancy of generalized Huffman codes
• Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }
• Tight bounds on the redundancy of Huffman codes
• New bounds on the redundancy of Huffman codes
• Tight upper bounds on the redundancy of Huffman codes
• A simple upper bound on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• scientific article; zbMATH DE number 4210045
• Asymptotic average redundancy of Huffman (and other) block codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Cited In (4)

• Development of two new mean codeword lengths
• Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \)
• Huffman algebras for independent random variables
• Title not available (Why is that?)

This page was built for publication: Redundancy-Related Bounds for Generalized Huffman Codes

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