Adaptive Huffman coding: Difference between revisions

Revision as of 18:01, 17 December 2004

Revision as of 02:22, 3 March 2005

Line 11:

Code is represented as a tree structure in which every node has a corresponding weight and a unique number.<br>

Numbers go down, and from right to left.

Weights must suffice '''sibling property''', that is what nodes can be listed in order of nonincreasing weight with each node adjacent to its sibling. Thus if A is parent node of B and node C is child of B, then <math>W(A)\ge W(B)\ge W(C)</math>.<br />

Line 22 ⟶ 21:

We need some general and straightforward method to transmit symbols which are '''not yet transmitted''' (NYT), we could use, for example, tranmission 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 beginingbeginning it is our initial NYT node.

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

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