Design and implementation of the Hoffman code
no vote
Application background Based on the formation of Huffman Tree respectively to achieve Huffman encoding and decoding, and the input and output test. For any given text file T01.txt statistical character weights (frequency of occurrence), and the generated code, the text for coding output file Huff01.txt. And in the program output between the two compression ratio. For any given Huff01.txt file, it can decode and get the original file T01.txt. Key Technology Data structure design: Huffman node, Huffman encoding Text compression: calculation to obtain the text character frequency, the establishment of Huffman tree, the character of the Huffman coding, text compressionExtracting text: reduction of encoder information, extracting text characters