# Math 5251: Error-Correcting Codes and Finite Fields

## Spring 2007

Homework/exam schedule and assignments
Assignment or Exam Due date Problems, mainly from Garrett's book
Homework 1 Wed Jan. 31 From Garrett's text:
1.28, 1.31, 1.33
2.03 (Note: I moved problem 2.04 to HW2)
3.02,3.05

Not from text:
A. Consider these three collections C1, C2, C3 of codewords:
C1={0,10,110,1110,1111}
C2={0,10,110,1110,1101}
C3={0,01,011,0111,1111}
Indicate for each (with explanation) whether or not it is
(a) uniquely decipherable,
(b) instantaneous.

B. Does there exist a binary code which is instantaneous and has code words with lengths (1,2,3,3)? If not, prove it. If so, construct one.

(Note: I am removing this problem from the HW's:
C. State and prove the precise conditions under which a random variable X on a finite probability space has entropy H(X) equal to zero.)
Homework 2 Wed Feb. 14 From Garrett's text:
2.04
4.01, 4.02, 4.04, 4.05, 4.06, 4.11

Not from text:
Let p be a probability between 0 and 1.
Explain why a noisy channel with input and output alphabets both {0,1} and the following probabilities is called a useless channel:
Midterm exam 1 Wed. Feb. 21 Midterm exam 1 in PostScript, PDF.
Homework 3 Wed Mar. 7 From Garrett's text:
5.01, 02, 03, 04, 05, 08
6.01, 03, 07, 22, 49, 50, 52, 80 (Prob. 6.37 is moved to HW4)
Homework 4 Wed Mar. 28 From Garrett's text:
6.30, 31, 37, 57, 81
8.17
9.11, 12
10.04, 08, 11
11.11
12.06, 12.10, 12.12, 12.14, 12.15
Midterm exam 2 Wed. Apr. 4 Midterm exam 2 in PostScript, PDF.
Homework 5 Wed Apr. 18 From Garrett's text:
12.01, 02, 04, 17, 19, 20
13.02, 05, 07, 09, 10
Homework 6 Wed Apr. 25 (note 1-week due date!) From Garrett's text:
14.02, 05
11.04, 05
15.03, 13
Final exam Wed. May 2 Final exam in PostScript, PDF.