(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 24 July 2006.
HTML page formatted Mon Sep 11 09:46:04 2006.
Cite this as:
Gopinath Srinivasan, "Lempel-Ziv-Welch", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 24 July 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/lempelZivWelch.html