| 摘要 |
The method involves the codes of individual symbols (Lit7, 00, 45, 6B, Lit8, 2C) being allocated by a branching tree which, starting from a tree root, branches out to the data symbols via branching nodes. The hierarchically highest plane (0) is the tree root. The branching tree is widened by a branching node on the first appearance of a new data symbol. A repeated appearance of a symbol (00) it is tested if less frequent symbol (Lit8), or a branching node are present in the hierarchical plane (plane 2 over 3). The repeatedly appearing symbol then reaches a higher plane of the branching tree.
|
