Introduction - If you have any usage issues, please Google them yourself
Huffman coding (Huffman Coding) is an encoding, data compression is a lossless entropy coding (right encoding) algorithm is used. Computer data processing, Huffman encoding uses variable length coding table source symbols (such as a file in a letter) is encoded, wherein the variable length coding table is a method of assessing the probability of occurrence by source symbols obtained appear high probability letters using a shorter code, otherwise the machine appears low use longer codes, which would make the average length of the string after encoding, reducing expectations, so as to achieve the purpose lossless data compression.