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.
CITATION STYLE
Yang, E., & Jia, Y. (2000). Universal lossless coding of sources with large and unbounded alphabets. In IEEE International Symposium on Information Theory - Proceedings (p. 16). https://doi.org/10.1007/978-1-4757-6048-4_36
Mendeley helps you to discover research relevant for your work.