Adaptive Huffman coding: Difference between revisions

Revision as of 02:22, 3 March 2005

Revision as of 02:22, 3 March 2005

Line 19:

To get the code for every node, in case of binary tree we could just traverse all the path from the root to the node, writing down (for example) "1" if we go to the right and "0" if we go to the left.

We need some general and straightforward method to transmit symbols which are '''not yet transmitted''' (NYT), we could use, for example, tranmissiontransmission of binary numbers for every symbol in alphabet.

Encoder and decoder start with the only the root node which has the maximum number, in the beginning it is our initial NYT node.