DocumentCode :
3146311
Title :
Fixed data base version of the Lempel-Ziv data compression algorithm
Author :
Wyner, A.D. ; Ziv, J.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fYear :
1991
fDate :
8-11 Apr 1991
Firstpage :
202
Lastpage :
207
Abstract :
It is demonstrated that a variant of the algorithm, where the data base is held fixed and is reused to encode successive strings of incoming input symbols, is optimal provided that the source is stationary and satisfies certain conditions (e.g. a finite-order Markov source)
Keywords :
Markov processes; data compression; Lempel-Ziv data compression algorithm; finite-order Markov source; fixed database; Binary sequences; Data compression; Decoding; Entropy; Size measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Compression Conference, 1991. DCC '91.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-9202-2
Type :
conf
DOI :
10.1109/DCC.1991.213361
Filename :
213361
Link To Document :
بازگشت