A note on D-ary Huffman codes

DOI10.1109/18.61134MaRDI QIDQ3199324zbMATH OpenOpenAlexFDO

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.61134

zbMATH Keywords

codewordD-ary Huffman codesentropysource coding

Mathematics Subject Classification ID

Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Tight bounds on the redundancy of Huffman codes
• A simple upper bound on the redundancy of Huffman codes
• Bounds on the redundancy of Huffman codes (Corresp.)
• Tight upper bounds on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)

Cited in

(6)

• New bounds on \(D\)-ary optimal codes
• Bounds on the redundancy of Huffman codes (Corresp.)
• On the redundancy of optimal codes with limited word length
• Tight upper bounds on the redundancy of Huffman codes
• Optimal binary search trees
• On the redundancy of D-ary Fano codes

This page was built for publication: A note on D-ary Huffman codes

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