RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1999 Volume 35, Issue 4, Pages 95–108 (Mi ppi465)

This article is cited in 6 papers

Source Coding

Efficient Method of Adaptive Arithmetic Coding for Sources with Large Alphabets

B. Ya. Ryabko, A. N. Fionov


Abstract: We consider the problem of constructing an adaptive arithmetic code for the case of a large source alphabet. We propose a method with encoding/decoding time, which is an order less than that for known methods. We also propose an implementation of the method with the use of a data structure called an “imaginary sliding window,” which makes it possible to essentially decrease the encoder/decoder memory capacity.

UDC: 621.391.15

Received: 18.01.1999


 English version:
Problems of Information Transmission, 1999, 35:4, 369–380

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026