We consider the problem of constructing an adaptive arithmetic code in the case when the source alphabet is large. A method is suggested whose coding time is less in order of magnitude than that for known methods. We also suggest an implementation of the method by using a data structure called "imaginary sliding window", which allows to significantly reduce the memory size of the encoder and decoder.
展开▼
