An improved sliding window data compression algorithm based on theLempel-Ziv data compression algorithm magnetic recording

摘要

A data compression scheme which can improve the efficiency of theLempel-Ziv data compression algorithm is presented. The proposed schemeis designed to save bits in specifying the length of the matchingstring. The scheme specifies the difference between the longest and thenext shortest length. Since this difference is never greater than thelength of the string, and often shorter, this scheme can never be lessefficient than the scheme where the length itself is used in thecodeword, and it is often more efficient. Curves comparing thecompression efficiencies of the improved Lempel-Ziv algorithm, theLempel-Ziv algorithm, and the Lempel-Ziv-Welch algorithm are given