Scribd
Upload
117 views2 pages

Assignment Source Coding

The document provides instructions for an assignment involving source coding questions. It asks the student to submit their answers to questions 2, 5, and 8 by September 25th, 2013. Question 5 asks the student to calculate entropies for random variables representing the outcome and number of games in a best-of-seven World Series, and to construct Huffman codes to represent the series outcome. Question 8 asks the student to find the binary Huffman code for a source with given probabilities and argue it is optimal for a different source with uniform probabilities.

Uploaded by

Kirshanthan Sundararajah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
117 views2 pages

Assignment Source Coding

The document provides instructions for an assignment involving source coding questions. It asks the student to submit their answers to questions 2, 5, and 8 by September 25th, 2013. Question 5 asks the student to calculate entropies for random variables representing the outcome and number of games in a best-of-seven World Series, and to construct Huffman codes to represent the series outcome. Question 8 asks the student to find the binary Huffman code for a source with given probabilities and argue it is optimal for a different source with uniform probabilities.

Uploaded by

Kirshanthan Sundararajah
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

EN4052 Communications III Assignment/Tutorial Source Coding

Work out all the questions. Submit your answers only for Questions 2, 5, and 8 on or before 25th September, 2013. 1.

2.

3. Let ( , ) be given by

Find: (a) (b) (c) (d) 4.

(), () (|), (|) (, ) () (|), () (|)

5. The World Series is a seven-game series that terminates as soon as either team wins four games. Let X be the random variable that represents the outcome of a World Series between teams A and B: possible values of X are, for example, AAAA, BABABAB, and BBBAAAA. Let Y be the number of games played, which ranges from 4 to 7. Assume that A and B are equally matched and that the games are independent. (a) Find the distributions of the random variables X and Y. (b) Calculate H(X), H(Y), H(Y|X), and H(X|Y). (c) Construct binary codes to represent the outcome X of the series, using each of the following methods: i. A coding scheme containing one bit for each match played that equals 0 or 1 according to whether the winner was A or B, respectively. ii. Huffman coding algorithm (d) Determine and comment on the expected lengths of the codes constructed in part (d) above. 6.

7.

8. Find the binary Huffman code for the source with probabilities (1/3, 1/5, 1/5, 2/15, 2/15). Argue that this code is also optimal for the source with probabilities (1/5, 1/5, 1/5, 1/5, 1/5). 9.

You might also like