Lempel-Ziv compression

Lempel-Ziv compression

Substitutional compression schemes proposed by Jakob Ziv and Abraham Lempel in 1977 and 1978. There are two main schemes, LZ77 and LZ78. Lempel-Ziv Welch compression is a variant of LZ78.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
The first group is called non-parameterized test and includes: Frequency Test, Cumulative Sums Test (forward and backward), Discrete Fourier Transform (Spectral) Test, Lempel-Ziv compression Test, test for Longest Run of Ones in a Block, Rank Test, Runs Test, Random Excursions Test, and Random Excursions Variant Test.The second group, referred to as a parameterized test, includes Serial Test, Linear Complexity Test, Overlapping Template of All Ones Test, Non-overlapping Template Matching Test, Approximate Entropy Test, Block Frequency Test, and Universal Statistical Test.
For example, the popular Lempel-Ziv compression scheme is strongly related to digital search trees.
Lempel-Ziv compression test: The focus of this test is the number of cumulatively distinct patterns (words) in the sequence.
Looking beyond simple conversion of the Java class file into a more compact format, an often-used solution for compression is word-stream compression techniques such as Huffman encoding [Huffman 1952] or Lempel-Ziv compression [Ziv and Lempel 1978].
This method, described in [29], is rleated to the second style of Lempel-Ziv compression, alluded to in the introduction.