Title :
Comparing the multilevel pattern matching code and the Lempel-Ziv codes
Author :
Ryabko, Boris Ya ; Suzuki, Joe
Author_Institution :
Siberian State Univ. of Telecommun. & Comput. Sci., Novosibirsk, Russia
Abstract :
The asymptotic performance of the multilevel pattern matching (MPM) code and a Lempel-Ziv´77 (LZ) code are compared. It is known that both codes have the Shannon entropy as the asymptotic performance if they are employed for stationary ergodic sources, but the redundancy of MPM is less than that of LZ. It is shown that there exists a large set of sequences that can be compressed well by LZ but cannot be compressed by MPM
Keywords :
codes; data compression; entropy; pattern matching; sequences; Lempel-Ziv codes; MPM code; Shannon entropy; asymptotic performance; code redundancy; lossless universal codes; multilevel pattern matching code; sequence compression; stationary ergodic sources; Pattern matching;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.935939
