Conditions for Optimality of the Huffman Algorithm
From MaRDI portal
Publication:3901006
DOI10.1137/0209035zbMath0453.68035OpenAlexW4242936418MaRDI QIDQ3901006
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
convex functionsRenyi entropyweighted treesSchur concavitynoiseless codingquasilinear functionsoptimal tree construction
Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Algorithms in computer science (68W99)
Related Items
A short note on the redundancy of degree \(\alpha\) ⋮ The \(d\)-majorization polytope ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ Huffman's algorithm via algebra ⋮ Huffman coding with non-sorted frequencies ⋮ Alphabetic coding with exponential costs ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ Huffman algebras for independent random variables