Description: The dominant idea of the Huffman coding is based on the probability of occurrence of data symbols for encoding.The higher the probability that the symbol appears in the source data and the corresponding code length is shorter smaller probability symbols, the code length is longer, so as to achieve as little as possible code symbols indicates that the source data. Huffman encoding method is close to the compression than the upper limit of an optimal encoding method.reduce the temporal redundancy, DCT technology to reduce the the image spatial redundancy, the use of entropy coding aspects reduce the informationa statistical redundancy. The integrated use of several techniques, which greatly enhanced the compression performance.
To Search:
File list (Check if you may need any files):
HuffmanCode.m
sortdata.m
visit.m
Huffman-example.m
Download