一种自适应奇偶校验容错的LZ '77压缩算法
An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm
摘要：
本文提出了一种改进的容错Lempel-Ziv'77（LZ'77）算法，该算法采用自适应的奇偶校验位数量来进行错误保护。它是最近提出的错误弹性算法LZRS'77的修改版本，其在所有编码数据块上使用恒定量的奇偶校验。恒定量的奇偶校验由编码字符串的最低冗余部分限定，而自适应奇偶校验更有效地利用编码字符串的可用冗余，并且平均可以高得多。因此，所提出的算法提供了更好的编码数据的错误保护。这两种算法的性能进行了测量。比较表明，使用自适应奇偶校验有明显的改善。所提出的算法是能够纠正多达几倍的错误，而原来的算法的压缩性能几乎保持不变。
英文摘要：
The paper proposes an improved error-resilient Lempel-Ziv'77 (LZ'77) algorithm employing an adaptive amount of parity bits for error protection. It is a modified version of error resilient algorithm LZRS'77, proposed recently, which uses a constant amount of parity over all of the encoded blocks of data. The constant amount of parity is bounded by the lowest-redundancy part of the encoded string, whereas the adaptive parity more efficiently utilizes the available redundancy of the encoded string, and can be on average much higher. The proposed algorithm thus provides better error protection of encoded data. The performance of both algorithms was measured. The comparison showed a noticeable improvement by use of adaptive parity. The proposed algorithm is capable of correcting up to a few times as many errors as the original algorithm, while the compression performance remains practically unchanged.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
