Skip to main content
Conference Proceedings

A derivation of Huffman’s algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 669 LNCS 375-378
DOI: 10.1007/3-540-56625-2_24
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a semi-formal derivation of Huffman's well-known algorithm for the construction of an optimal encoding tree.

Cite

CITATION STYLE

APA

Hoogerwoord, R. R. (1993). A derivation of Huffman’s algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 669 LNCS, pp. 375–378). Springer Verlag. https://doi.org/10.1007/3-540-56625-2_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free