Content deleted Content added
External links |
mNo edit summary |
||
Line 30:
A variation called '''adaptive Huffman coding''' calculates the frequencies dynamically based on recent actual frequencies in the source string. This is somewhat related to the [[LZ77|LZ]] family of algorithms.
Most often, the weights used in implementations of Huffman coding represent numeric probabilities, but the algorithm given above does not require this; it requires only a way to order weights and to add them. '''Huffman Template algorithm''' enables to use non-numerical weights (costs, frequences).
The '''n-ary Huffman''' algorithm uses the {0, 1, ..., n-1} alphabet to encode message and builds an n-ary tree.
| |||