Adaptive Arithmetic Coding
The presented algorithms in principle work with a given probability distribution. This is however not inevitably necessary, after each coding of a symbol the distribution could be changed.
Equivalent to adaptive Huffman coding, it is a possible strategy to regard the symbols already encoded and to adapt the probability array every time. Another proceeding would be to implement a prediction algorithm which shall analyse the changes of the past to predict the probabilities for future use.
A permanent adaptation of the probability table requires naturally a substantial additional cost of computation.
< ^ >

Adaptive Huffman Code []

