Conditions for Optimality of the Huffman Algorithm

DOI10.1137/0209035MaRDI QIDQ3901006zbMATH OpenOpenAlexFDO

Authors D. Stott Parker

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0209035

zbMATH Keywords

convex functionsnoiseless codingoptimal tree constructionquasilinear functionsRenyi entropySchur concavityweighted trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99) Information theory (general) (94A15) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Cited in

(8)

• The \(S\)-digraph optimization problem and the greedy algorithm
• A short note on the redundancy of degree
• Huffman's algorithm via algebra
• Huffman algebras for independent random variables
• The d-majorization polytope
• ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC
• Huffman coding with non-sorted frequencies
• Alphabetic coding with exponential costs

This page was built for publication: Conditions for Optimality of the Huffman Algorithm

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