EE 387 Algebraic Error-Control Codes Homework #2 Due Friday, October 12

October 5, 2012 Handout #4

1. Product code. The product of a (7,4) Hamming code with itself is a (49,16) binary code with minimum distance 9 and therefore error-correcting ability 4. Devise an ad hoc error-correction method that can correct up to four bit errors no matter how they are distributed in a 7 7 array of received bits. Hint: consider the various number of rows that can be aected by up to four errors. 2. Single error correction. A block code C is dened by the following parity-check matrix: H= 1 1 1 1 1 2 3 15 1 c1 + 1 c2 + + 1 c15 = 0 1 c1 + 2 c2 + + 15 c15 = 0

a. Find the encoding equations for c1 , c2 in terms of c3 , . . . , c15 for modulo 16 arithmetic. b. Correct r = (10, 0, 9, 6, 1, 0, 0, 2, 5, 1, 0, 0, 1, 0, 0) using modulo 16 arithmetic; that is, nd all codewords that dier from r by a single symbol error. 3. Cooked error rate. A (15,11) binary Hamming code is used on a binary symmetric channel with raw error rate 104 . Find the cooked error rate the probability that a decoded message bit is incorrect. Fact: when two bit errors occur, the decoder incorrectly changes a third codeword bit. You may assume that the probability of 3 errors is negligible. 4. Gilbert-Elliot channel. The Gilbert-Elliot channel model is shown below.
1 1 good 2 1 bad 1 2

Suppose that the transition probabilities are 1 = 106 and 2 = 101 . a. Find the average length of an error burst. b. Find the average length of an error-free sequence of bits. c. Find the bit error rate for this Gilbert-Elliot channel. 5. Euler -function. a. Find (2m 1) for m = 2, 4, 8, 16, 32. b. Find (193), (284), (440), (669), (788), and (1024). 6. Interleaved code. Interleaved codes are used to protect against burst errors and random errors. The codeword shown below consists of 10 codewords each with 1000 message bits and 10t check bits, where t is the number of bit errors that can be corrected in each row.

The desired bit error rate after correction is 1012 . For raw bit error rate 107 , nd t, the number of bits per row that must be corrected.