Coding Theory: Math 696
Spring 2004

Assignments



Assigned exercises in my notes




Due Date Section Problems
Fri. 1/30 3 9.1, 21.2, 21.3, 21.4
. 4 7.1c, 24.3, 24.6*
Mon. 2/9 5 15.1, 15.2, 15.3, 15.6, 15.8, 15.9
Wed. 2/16 RS 2 1.1, 3.2
. RS 3 6.1-3 (for n=6, 7, 8); 6.4, 6.5, 6.6
Wed. 3/3 RS 4 1.1, 1.2
. RS 5 11.1, 11.2
Fri. 3/12 RS 5 11.3, 11.4
. RS 6 1.1, 1.2
. RS 7 7.4, 7.5
Fri. 4/2 8.2 2, 6 (for 8.2.2), 12, 14b, and my 8*

*4.24.6 Find all irreducible polynomials of degree 2 and of degree 3 over GF(3). Choose one of these irreducibles and identify a system of representatives for the field constructed from it. Find a polynomial of degree 4 over GF(3) which has no roots, but is not irreducible.

8* Draw the trellis diagram for the code of 8.2.2 assuming an information sequence of length 4.
Decode 1_2 1_1 0_1, 1_2 0_2 0_1, 0_1 1_1 1_1, 0_2 1_1 1_1, 1_1 0_2 1_1, 0_2 0_2 0_2, 1_1 1_1 0_2