DocumentCode :
2623247
Title :
A class of noiseless data compression algorithms based on Lempel-Ziv parsing trees
Author :
Kieffer, John ; Finamore, Weiler ; Nunes, Paulo
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
fYear :
1994
fDate :
27 Jun-1 Jul 1994
Firstpage :
6
Abstract :
A class of codes for noiseless data compression is introduced. The codes are based on the trees that one associates with the Lempel-Ziv parsing technique. This class includes many known variants of the Lempel-Ziv algorithm and some new ones. Results are presented which relate the individual sequence compression performance of codes in the class to the compression performance achievable via the Lempel-Ziv algorithm
Keywords :
codes; data compression; grammars; sequences; trees (mathematics); Lempel-Ziv algorithm; Lempel-Ziv parsing trees; codes; noiseless data compression algorithms; sequence compression performance; Bars; Data compression; Writing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
Type :
conf
DOI :
10.1109/ISIT.1994.394965
Filename :
394965
Link To Document :
بازگشت