Adaptive Huffman coding: Difference between revisions

Revision as of 19:21, 9 November 2007

Revision as of 19:23, 9 November 2007

Line 38:

====Example====

[[Image:adaptive_huffman.png|Developing adaptiveadapive Huffman tree]]

Start with empty tree.

Line 61:

Future code for '''"b"''' is 1, and for '''"a"''' is now 01, which reflects their frequency.

--------------------------------------------

Dear Scholars...

I understood your "abb" example shown above...But I still want a clear idea about this Vitters Algorithm. Can u please implement this example by using few more repeated characters like the string as shown below...

"ab ab abcde".

I want to understand clearly how is it working... Please consider my request. Im waiting for your reply.Thanking u Scholars..

--------------------------------------------

== External links ==