(algorithm)
Definition: A compression algorithm that codes strings of characters with codes of a fixed number of bits. Every new string in the input is added to a table until it is full. The codes of existing strings are output instead of the strings.
Also known as LZW compression.
See also algorithm BSTW.
Author: GS
J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Transactions on Information Theory, May 1977.
Terry Welch, A Technique for High-Performance Data Compression, Computer, June 1984.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:24:12 2004.
HTML page formatted Wed Oct 26 09:47:44 2005.
Cite this as:
Gopinath Srinivasan, "Lempel-Ziv-Welch", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/lempelZivWelch.html
