A popular lossless algorithm used for data compression. Essentially, Huffman encoding replaces frequently-occurring code strings with shorter ones, often by means of a look-up table explaining what the shorter codes mean. See Data Compression.
|
A popular lossless algorithm used for data compression. Essentially, Huffman encoding replaces frequently-occurring code strings with shorter ones, often by means of a look-up table explaining what the shorter codes mean. See Data Compression.