Archived

This topic is now archived and is closed to further replies.

Galileo430

Huffman Codeing

Recommended Posts

c_wraith    122
Try this: http://swww.ee.uwa.edu.au/~plsd210/ds/huffman.html

Notice down at the bottom, where it has a button that runs a java program to demonstrate operation of creating and using Huffman trees. The explanation is pretty good too.

One thing to note about the demonstration: It uses a sorted linear list to determine the lowest two frequencies in the table. In practice, you want to use a heap based priority queue, in order to get a more efficient conversion method.

Edited by - c_wraith on January 31, 2001 5:38:53 PM

Share this post


Link to post
Share on other sites