Animation of Lempel-Ziv Encoding Algorithm
Encoding Algorithm
- Initialize the dictionary to contain all blocks of length one
(D={a,b}).
- Search for the longest block W which has appeared
in the dictionary.
- Encode W by its index in the dictionary.
- Add W followed by the first symbol of the next block to
the dictionary.
- Go to Step 2.
(it takes about 2 minutes to loop through the animation)
|
