Linear time adaptive arithmetic coding

Abstract

The issue of how arithmetic coding should be implemented is addressed. A data structure is described and shown to support adaptive arithmetic coding on an arbitrary-sized alphabet in time linear in the size of the inputs and outputs. Experimental results that show the method to be useful even on relatively small alphabets are given.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>