Huffman: Difference between revisions
Jump to navigation
Jump to search
m (link fix) |
m (Video Link) |
||
| Line 1: | Line 1: | ||
'''Huffman coding''' is an [[entropy encoding]] algorithm used for [[lossless compression|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 coding''' is an [[entropy encoding]] algorithm used for [[lossless compression|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 [http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-450Fall-2006/VideoLectures/index.htm MIT 6.450]. | |||
[[Category:Compression Theory]] | [[Category:Compression Theory]] | ||
Latest revision as of 20:50, 15 February 2009
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.