A sequential algorithm for the universal coding of finite memory sources
M.J. Weinberger, A. Lempe, J. Ziv · IEEE Transactions on Information Theory · 1992
The estimation and universal compression of discrete sources are considered, and a sequential algorithm for the universal coding of finite memory sources, attaining asymptotically minimum redundancy, is presented. The algorithm performs an online estimation of the source states and uses an arithmetic code.>