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: EE 5581 Prof. Jindal Information Theory & Coding Sept. 23, 2010 Homework 3 Due: Friday, Oct. 1, 5:00 PM 1. C & T 5.37 2. C & T 5.4 3. C & T 5.5 4. C & T 5.6 5. C & T 5.21 Note: The definition of a uniquely decodable code states that every input sequence of any length must map to a different codeword. In this problem you show that an equivalent condition for unique decodability is showing that for each k 1, the map- ping from all length k sequences to output codewords is non-singular. The difference is that the equivalent condition only compares the codewords of input sequences of equal length, while the definition compares codewords of input sequences of possibly different lengths. 6. C & T 5.9 7. In this problem you are to implement the arithmetic coding algorithm in Matlab. Your assignment is to fill in the files arithmetic_coding.m decode_arithmetic.m to implement arithmetic encoding and decoding, respectively (empty versions of these files with the correct function headers are given to you)...
View Full Document
This note was uploaded on 10/10/2010 for the course EE 5581 taught by Professor Moon,j during the Fall '08 term at Minnesota.
- Fall '08