Huffman coding
Sign in to saveentropy encoding algorithm used for lossless data compression
Wikidata facts
Show 3 more facts
- publication date
- 1952-09-00
- Stack Exchange tag
- stackoverflow.com/tags/huffman-code
- Commons category
- Huffman coding
Sources (3)
via Wikidata · CC0
~28 min read
Article
Huffman tree generated from the exact frequencies of the text "this is an example of a huffman tree". Encoding the sentence with this code requires 135 (or 147) bits, as opposed to 288 (or 180) bits if 36 characters of 8 (or 5) bits were used (This assumes that the code tree structure is known to the decoder and thus does not need to be counted as part of the transmitted information). The frequencies and codes of each character are shown in the accompanying table.
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code is Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".