Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

LZ78 Algorithm

String Algorithm

LZ78 is a lossless data-compression algorithm published by Abraham Lempel and Jacob Ziv in 1978, also known as Lempel-Ziv 2. Unlike its sliding-window predecessor LZ77, LZ78 is theoretically a dictionary coder built from an explicit dictionary that is constructed during encoding and decoding as a new phrase is added whenever a token is output, a design that could in principle allow random access to the input if the entire dictionary were known in advance, though in practice the dictionary is built incrementally rather than in advance. LZ78 forms the basis of later variations including LZW, and LZ77 and LZ78 together were named an IEEE Milestone in 2004.

Connections

In Field

Source LZ77 and LZ78 (Wikipedia)

Preceded By

LZ77 Algorithm, Algorithms

Abraham Lempel and Jacob Ziv published LZ77 in 1977 and its successor LZ78 in 1978, the two founding dictionary-coding algorithms of the LZ family.

Sources
LZ77 and LZ78 (Wikipedia)
  • In Group: Data Compression Algorithms, Lead section
    are the two lossless data compression algorithms
  • In Field: Algorithms and Complexity Theory, Lead
    LZ77 and LZ78 are the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.