Conditions for Optimality of the Huffman Algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 1980 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 9, pages 470-489 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Douglas Stott Parker Jr.;

doi: 10.1137/0209035

Conditions for Optimality of the Huffman Algorithm

- Summary
- Subjects
- Metrics

No summary information available

Keywords

optimal tree construction, convex functions, Measures of information, entropy, Schur concavity, noiseless coding, Information theory (general), Renyi entropy, Coding theorems (Shannon theory), Graph theory (including graph drawing) in computer science, quasilinear functions, weighted trees, Algorithms in computer science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	41
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average