From MultimediaWiki
Jump to: navigation, search

Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol.

Huffman code generation is explained at 36:13 in Lecture 3 of MIT 6.450.