Revision as of 11:22, 6 March 2008 edit 221.134.226.101 (talk) No edit summary ← Previous edit		Revision as of 04:15, 17 March 2008 edit undo 99.236.145.225 (talk) →Vitter algorithm Next edit →
Line 11: Numbers go down, and from right to left. Weights must ~~suffice~~satisfy the '''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)> W(B) > W(C)</math>. The weight is merely the count of symbols transmitted which codes are associated with children of that node.

Adaptive Huffman coding: Difference between revisions