Conditions for Optimality of the Huffman Algorithm
From MaRDI portal
Publication:3901006
DOI10.1137/0209035zbMath0453.68035MaRDI 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 functions; Renyi entropy; weighted trees; Schur concavity; noiseless coding; quasilinear functions; optimal tree construction
68R10: Graph theory (including graph drawing) in computer science
94A17: Measures of information, entropy
94A15: Information theory (general)
94A24: Coding theorems (Shannon theory)
68W99: Algorithms in computer science
Related Items
Alphabetic coding with exponential costs, The \(S\)-digraph optimization problem and the greedy algorithm, A short note on the redundancy of degree \(\alpha\), Huffman's algorithm via algebra, Huffman algebras for independent random variables, ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC