LAUSR

In this study, we develop a novel error detection algorithm for Lempel-Ziv-77 (LZ77) compressed data. In the proposed algorithm, additional bits are not used to detect bit errors, unlike in conventional methods such as checksum, cyclic redundancy check, Hamming code, and repetition code. We also introduce eight special features of LZ77-compressed data for detecting the presence of errors. We demonstrate the feasibility of the algorithm based on simulations and evaluate it using two publicly available databases comprising the Calgary and Canterbury corpora. The error detection rate using the proposed algorithm is below those of conventional methods, but the compression ratio is better. The application of a parity bit in the algorithm improves the error detection performance. The number of redundant bits increases owing to the insertion of the parity bit, but the code rate is still greater than or equal to 0.9, whereas conventional methods obtain code rates less than 0.9. Simulations demonstrate that the algorithm obtains significant performance improvements when a parity bit is periodically inserted. In particular, we achieve an error detection rate of 100% using the parity bit when the number of bit errors is greater than seven.