Huffman coding: Difference between revisions

Content deleted Content added
Jianglai (talk | contribs)
Undid revision 1255644241 by Jianglai (talk)
Line 249:
 
=== Adaptive Huffman coding ===
A variation called '''[[adaptive Huffman coding]]''' involves calculating the probabilities dynamically based on recent actual frequencies in the sequence of source symbols, and changing the coding tree structure to match the updated probability estimates. It is used rarely in practice, since the cost of updating the tree makes isit slower than optimized [[Arithmetic coding#Adaptive arithmetic coding|adaptive arithmetic coding]], which is more flexible and has better compression.
 
=== Huffman template algorithm ===