hw6 - ECE 5620 Spring 2011 Homework #6: Issued Apr. 1, Due...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 5620 Spring 2011 Homework #6: Issued Apr. 1, Due Apr. 22 at 5 p.m. Complete all eight problems. 1. Problem 5 in Chapter 13 of the text. 2. Problem 6 in Chapter 13 of the text. 3. Problem 9 in Chapter 13 of the text. 4. Show that the arithmetic coding algorithm discussed in class is prefix-free. 5. Show that the Lempel-Ziv algorithm discussed in class is prefix-free. 6. Consider the arithmetic coding algorithm discussed in class for a binary- valued Markov source with a uniform initial distribution and transition ma- trix P = ± 3 / 4 1 / 4 1 / 4 3 / 4 ² . Thus the realization 0110 is encoded to 0110101. (a) Determine the encoding of 1101. (b) Suppose a string of length 4 is encoded to 01110. Determine the origi- nal string. 7. How long is the shortest string with the property that “Without loss of gener- ality, it may be assumed that” (without the quotes) is a phrase in its Lempel- Ziv parsing? 8. Consider the string
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course ECE 5620 at Cornell.

Page1 / 2

hw6 - ECE 5620 Spring 2011 Homework #6: Issued Apr. 1, Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online