Course: CIS451/651
Data Compression in Multimedia
Professor: Paul D. Amer
Semester: Spring 2009
Title: Homework Chapter 5 - Dictionary Coding Methods
Due Date:
Tasks
Read the entire Chapter 5. You need to know details of LZW as explained in class (i.e., textbook examples 5.4.3, 5.4.4)
-
(3 pts) Chapter 5: Projects and Problems: 3
-
(3 pts) Chapter 5: Projects and Problems: 4
- (submit) after completing Part (b), also answer the following question: In general, is it possible to get answers that do not match?
-
(3 pts) Chapter 5: Projects and Problems: 5
-
(2 pts) Chapter 5: Projects and Problems: 8
- Assume the Initial Dictionary is enumerated 1,2,3,4,5, not a,b,c,d,e.
-
(3 pts) Given an initial dictionary consisting of ASCII 8-bit encodings
(values 0-255), encode the following 8-word message using the LZW algorithm.
Show your dictionary as it exists at the end. Do not forget to encode
the 7 blanks that separate words: sir sid eastman
easily teases sea sick seals
-
(3 pts) Assume a two symbol alphabet with the symbols {a,b}. Show
the first 15 dictionary entries for the LZW encoding of the infinte string:
ababab...
Notes
-
Students may work individually or in groups of 2.
- Students
in different groups may NOT compare answers prior to submitting their assignment.
See the
syllabus for the full statement on the late policy and academic honesty.
-
Answers to LZW encodings should be given as decimal codes, not in binary.