Conditions for Optimality of the Huffman Algorithm
- 1 August 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (3) , 470-489
- https://doi.org/10.1137/0209035
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Fast Algorithms for Manipulating Formal Power SeriesJournal of the ACM, 1978
- Combinatorial MergingIEEE Transactions on Computers, 1976
- On the Optimality of Huffman TreesSIAM Journal on Applied Mathematics, 1976
- Optimal Binary Search Trees with Restricted Maximal DepthSIAM Journal on Computing, 1974
- Determination of all additive quasiarithmetic mean codeword lengthsProbability Theory and Related Fields, 1974
- Bounds on Optimal Merge Performance, and a Strategy for OptimalityJournal of the ACM, 1972
- Optimal Computer Search Trees and Variable-Length Alphabetical CodesSIAM Journal on Applied Mathematics, 1971
- Definition of entropy by means of a coding problemProbability Theory and Related Fields, 1966
- A coding theorem and Rényi's entropyInformation and Control, 1965
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952