Lempel-Ziv-Welch Exercise
The following list of decimal numbers should be interpreted
as successive 12-bit dictionary indices sent using the Lempel-Ziv-Welch
algorithm we went over in class on Friday, 9/15/95.
You can find a description of this algorithm in part 2, question 70, of the
data compression FAQ.
Your job is to decompress this compressed message, determine
how much compression actually took place, and say the message
six times really fast.
116
104
101
32
115
105
120
256
259
105
99
107
259
257
105
107
39
115
264
262
104
268
101
101
112
272
264
266
Jeff Ondich,
Department of Mathematics and Computer Science,
Carleton College, Northfield, MN
55057
(507) 663-4364,
jondich@carleton.edu