Adaptive Huffman coding: Difference between revisions

Revision as of 20:16, 20 August 2005

Revision as of 22:31, 26 October 2005

Line 21:

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

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

When we transmit an NYT symbol we have to transmit code for the NYT node, then for its generic code.

For every symbol which is already in the tree we only have to transmit code for its '''leaf node'''.

For every symbol transmitted on both sides we must execute '''update procedure''':