Lempel-Ziv algorithm
Quick Summary
The Lempel-Ziv algorithm is a data compression technique developed in the 1970s by Abraham Lempel and Jacob Ziv. It is highly effective for telecommunications because it reduces the number of bits needed to transmit data, thereby increasing efficiency within a limited bandwidth.1
Unlike methods that require prior knowledge of data probabilities, Lempel-Ziv dynamically builds a codebook from previously encountered sequences. For instance, if a sequence of data levels appears, the algorithm assigns a code word for it. If that sequence reappears, instead of transmitting the full sequence again, it sends a shorter code indicating the repetition. This process allows for adaptive compression, optimizing the encoding based on the specific data being transmitted. This method can compress English text by approximately 55 percent, outperforming techniques like Huffman coding.12
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

