Description: Huffman coding is a lossless data compression entropy coding (right coding) for the algorithm. With variable-length coding tables on the source symbol (such as a file in a letter) to encode, which is a method of variable length coding table through an assessment of the probability of occurrence of the source symbols obtained letters appear high probability using a shorter code, and vice versa low appears machine code using a longer, which would make the average length of the string after encoding, expectations are lower, so as to achieve the purpose of lossless data compression.
To Search:
File list (Check if you may need any files):
HuffmanTree.cpp
Download