An Adaptive-Parity Error-Resilient LZ'77 Compression Algorithm

TL;DR

This paper introduces an adaptive-parity error-resilient LZ'77 compression algorithm that dynamically adjusts parity bits for improved error correction without sacrificing compression efficiency.

Contribution

It presents a novel adaptive parity scheme for LZ'77, enhancing error resilience over previous constant-parity methods with minimal impact on compression performance.

Findings

Adaptive parity improves error correction capacity.

Error resilience is significantly enhanced compared to fixed parity.

Compression performance remains stable despite increased error correction.

Abstract

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.