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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have