Los puntos clave no están disponibles para este artículo en este momento.
An alternative procedure for reducing the computational complexity, which is applicable to both binary and multialphabet arithmetic coding, is described and its performance analysed with respect to the small increase in code length.>
Chevion et al. (Mon,) studied this question.