ece6605-hwk2 - Problem 5: Suppose that a six sided die is...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
GEORGIA INSTITUTE OF TECHNOLOGY School of Electrical and Computer Engineering ECE 6605 Information Theory Assigned: Friday, Sep. 17, 2010 Due: Atlanta and Savannah students: Friday, Sep. 24, 2010 Due: Video students: Friday, Oct. 1, 2010 Problem Set #2 Problem 1-4: Solve the questions 3.1, 3.7, 3.8, and 3.13 from Chapter 3 of the textbook (the second edition). For the definition of the smallest set in Problem 3.13 refer to page 62 of the textbook)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Problem 5: Suppose that a six sided die is thrown n times; assume that n is large. The faces of the die are numbered 1 through 6, and each is equally likely. Find a good upper bound on the probability that the average of the numbers computed over the n throws is less than 2.5. Hint: use Chebyshev’s inequality. Problem 6-7 (Optional): Solve the questions 3.9, and 3.10 from Chapter 3 of the text-book (the second edition). 1...
View Full Document

This note was uploaded on 10/10/2010 for the course ECE 6605 taught by Professor Staff during the Fall '08 term at Georgia Institute of Technology.

Ask a homework question - tutors are online