Update Code Tree

Update Procedure:

Since the update procedure is passed once for every coding, the node weight of all involved nodes can increase only by one. Therefore the rule can be derived that changes effect only nodes within the current block, i.e. only nodes has to be regarded having the same weight.

Provided that the current node is not already placed at the most significant position within the block, it has to be exchanged with the most significant node.

After the block wise analysis the current node weight is increased by one; the node reaches the higher-order block automatically provided that this exists. Afterwards it will be continued with the superordinated parent node until the root of the code tree is reached.

A special situation arise, if the most significant node of the block is the parent node of the current node. The exchange with its own parent node does not make sense and has to be suppressed. Because the parent node will automatically get a higher weight in the next step, the compliance with all rules is guaranteed.

In the example this procedure is described in detail demonstrating the evolvement of the code table.

 <   ^   >