Glossary Huffman code

Definition of Huffman code

Huffman code

1.  A data-compression method that is based on the frequency of individual components. Components that are more frequently used are assigned shorter code in bits, while less utilized components have longer code.

More Information:
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.