Title :
Universal lossless coding of sources with large and unbounded alphabets
Author :
Yang, En-Hui ; Jia, Yunwei
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
Abstract :
A multilevel arithmetic coding algorithm is proposed to encode data sequences with large or unbounded source alphabets. The algorithm is universal in the sense that it can achieve asymptotically the entropy rate of any independently and identically distributed integer source with a finite or infinite alphabet, as long as the mean value is finite
Keywords :
arithmetic codes; entropy; source coding; data sequences; entropy rate; finite alphabet; i.i.d. integer source; independently identically distributed integer source; infinite alphabet; large alphabets; multilevel arithmetic coding algorithm; unbounded alphabets; universal lossless source coding; Arithmetic; Binary search trees; Binary sequences; Councils; Data compression; Decoding; Entropy; Equations; Information technology; Tree data structures;
Conference_Titel :
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location :
Sorrento
Print_ISBN :
0-7803-5857-0
DOI :
10.1109/ISIT.2000.866306
