Comparing the multilevel pattern matching code and the Lempel-Ziv codes

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.935939

B. Ryabko, J. Suzuki

引用次数: 1

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.

查看原文本刊更多论文

多层模式匹配码与Lempel-Ziv码的比较

比较了多级模式匹配(MPM)码和LZ码的渐近性能。对于平稳遍历源，两种码都有Shannon熵作为渐近性能，但MPM的冗余度比LZ的少。结果表明，存在大量的序列可以很好地用LZ压缩，而不能用MPM压缩。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)

自引率

0.00%

发文量