Description: Huffman algorithm and its application
Given the right value of n as n-leaf node, construct a binary tree, if the weighted path length to a minimum, that such a binary tree for the optimal binary tree, also called Huffman tree. Huffman coding is a tree of files based on Huffman coding. Huffman coding is a variable word length coding. The course design has been built is a text file, the file statistics in the frequency of each character, the character of the Huffman coding, Huffman coding the translation of documents into the file, and then Huffman coding translation of documents into the original file. Compressed file that is read documents, statistics the number of characters in the file, the file Huffman encoding and decoding and encoding decoded characters are stored in files.
To Search:
File list (Check if you may need any files):
哈夫曼算法及其应用课程设计报告.doc
Download