DocumentCode :
1161996
Title :
A sequential algorithm for the universal coding of finite memory sources
Author :
Weinberger, Marcelo J. ; Lempe, A. ; Ziv, Jacob
Author_Institution :
Technion-Israel Inst. of Technol., Haifa, Israel
Volume :
38
Issue :
3
fYear :
1992
fDate :
5/1/1992 12:00:00 AM
Firstpage :
1002
Lastpage :
1014
Abstract :
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
Keywords :
data compression; encoding; redundancy; state estimation; arithmetic code; asymptotically minimum redundancy; discrete source; finite memory sources; online estimation; sequential algorithm; source states estimation; universal coding; universal compression; Arithmetic; Computer science; Entropy; Information theory; Jacobian matrices; State estimation;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.135641
Filename :
135641
Link To Document :
بازگشت