# hw3 - EE595A Introduction to Information Theory Winter 2004...

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

EE595A Introduction to Information Theory University of Washington Winter 2004 Dept. of Electrical Engineering Handout 5: Problem Set 3: (due Fri. Feb 27th by 4:30pm) Prof: Jeff A. Bilmes <[email protected]> Lecture 10, Feb 18, 2004 Book Problems Problem 1: a Define the geometric mean. b Why is the geometric mean called the geometric mean? c What is similar about the geometric mean and entropy? Problem 2: a Encode the string 001010010101010010101010101001010101 using the basic Lempel-Ziv algorithm we described in class. b Encode the string 1100011011111000000010010111100110000111 using the basic Lempel-Ziv algorithm we de- scribed in class. c Can you characterize the difference between these two strings? Did you notice this difference immediately when you first glanced at them? Why or why not? Problem 3: You’ve discovered a random number generator that generates random strings of bits M 1: n ( M i ∈ { 0 , 1 } ) for any n . Each such bit string corresponds to sampled music recordings (one sample might be Miles Davis or John Coltrane,

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/12/2009 for the course EE 596A taught by Professor Jeffa.bilmes during the Winter '04 term at Washington University in St. Louis.

### Page1 / 2

hw3 - EE595A Introduction to Information Theory Winter 2004...

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

View Full Document
Ask a homework question - tutors are online