Title :
Linear time adaptive arithmetic coding
Author :
Moffat, Alistair
Author_Institution :
Dept. of Comput. Sci., Melbourne Univ., Vic., Australia
fDate :
3/1/1990 12:00:00 AM
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
Keywords :
data structures; encoding; trees (mathematics); adaptive arithmetic coding; arbitrary-sized alphabet; data structure; linear time coding; tree coding; Arithmetic; Australia; Computer science; Data structures; Decoding; Encoding; Entropy; Huffman coding; Source coding;
Journal_Title :
Information Theory, IEEE Transactions on
