2 min read

How Lempel and Ziv’s 1977 and 1978 Algorithms Compress Data

Technion researchers Abraham Lempel and Jacob Ziv published two influential lossless compression algorithms in 1977 and 1978. LZ77 refers back to repeated strings in earlier data; LZ78 builds a dictionary of phrases as it reads.

Miriam Bernstein

Miriam Bernstein is the pen name of Hasbara’s Resources desk. Articles on this desk are written and published automatically by artificial intelligence, with no person reviewing them before publication.

LZ77 and LZ78 are lossless data-compression methods published by Technion researchers Abraham Lempel and Jacob Ziv in 1977 and 1978. Both find repeated patterns without requiring a complete statistical model of the data. LZ77 refers to earlier text; LZ78 builds a dictionary of phrases as it processes the input.

LZ77 points back to a match

The 1977 paper, “A Universal Algorithm for Sequential Data Compression,” presents a method that encodes a sequence by using patterns already encountered in it. When a string repeats, the encoder can represent it by a reference to an earlier occurrence rather than writing the whole string again. This is the central idea behind the LZ77 family, including later sliding-window implementations. The Technion’s research record identifies the original paper and its publication in IEEE Transactions on Information Theory in May 1977.

The paper calls the method universal because it adapts to the sequence instead of relying on prior knowledge of its source probabilities. Its analysis compares the compression ratio with bounds for codes designed around a known source. The original paper is available through the Technion research catalog.

LZ78 grows a phrase dictionary

The 1978 paper, “Compression of Individual Sequences via Variable-Rate Coding”, introduced a related approach. LZ78 records phrases in a dictionary as it reads the input. A new phrase can be encoded as a reference to a phrase already recorded plus the next symbol, after which that phrase enters the dictionary. Like LZ77, it learns recurring structure as it goes, but it stores and references phrases differently.

The two algorithms are related foundations, not interchangeable descriptions of one encoding. Later methods adapted their ideas. Terry Welch’s 1984 LZW algorithm, for example, is based on the LZ78 approach. The Technion’s account of 40 years of the Lempel–Ziv algorithm describes the 1977 contribution to lossless compression, while its computer science faculty history places the work in the university’s research record.

Why the distinction matters

Modern archivers and compression libraries combine algorithmic ideas with additional coding stages and engineering choices. LZ77 and LZ78 influenced a broad family of lossless methods, but that does not mean every common file format descends directly from one paper. Their importance is specific: two Technion researchers developed practical universal approaches for finding and encoding repeated structure in data.

For the university’s broader contribution to technology companies and research, see the Technion and Israel’s technology economy.

Sources

  1. 1.https://cris.technion.ac.il/en/publications/a-universal-algorithm-for-sequential-data-compression
  2. 2.https://ver2018.presidentsreport.technion.ac.il/40-years-of-the-lempel-ziv-algorithm/
  3. 3.https://www.technion.ac.il/en/blog/2019/11/50-years-for-technions-faculty-of-computer-science/
  4. 4.https://ieeexplore.ieee.org/document/1055934

Accessibility

These settings are saved on this device.

Preview

Read clearly, your way

Adjust this page while you read. Explore resources

Text
Text sizeApplies across the site.
Colour and contrast
Theme
Motion
AnimationsMatch device follows your reduced motion setting.