This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Problem 3 The code you constructed in Problem 2 can be improved by considering pairs oF letters. Assume that the source generating letters is memoryless. Thus the probability oF occurence, For example, oF the sequence AB is 0.02, which is the product oF probailities oF occurence oF A and oF B separately. (a) Construct a new alphabet consisting of all possible pairs of letters from Problem 1. (b) Compute the entropy of the alphabet. (c) Construct a HoFman code for this new alphabet. (d) Calculate the average length of codewords in (c). (e) Dene the eciency of the code as the ratio of the entropy of the alphabet and the average length of codewords. Compare the eciency of the code from Problem 2 with the eciency of the code in (c). 2...
View
Full
Document
This note was uploaded on 06/25/2008 for the course ECE 2200 taught by Professor Johnson during the Spring '05 term at Cornell University (Engineering School).
 Spring '05
 JOHNSON

Click to edit the document details