Introduction - If you have any usage issues, please Google them yourself
Lossless compression algorithms: Huffman coding. Huffman algorithm is the process: the original data in the statistical frequency of occurrence of each character all the characters by frequency in descending order build the Huffman tree: the resulting data will be stored in the Huffman tree re-encoding the original data to the results of the data.