MATH 392 -- Seminar in Coding Theory, Spring 2002

Syllabus and Schedule

• Course syllabus and schedule

Examples, Class Notes, Etc.

• What do we gain with error-control coding ?
• Discussion 1 solutions
• Problem Set 2 solutions
• Discussion 2 solutions
• Midterm problem set solutions
• Problem Set 3 solutions
• Reed-Solomon code example
• Maple coding theory package
• Final problem set solutions

Assignments

• Individual Problem Set 1 -- Due: Friday, January 25.
• Discussion 1 -- Due: Wednesday, January 30.
• Individual Problem Set 2 -- Due: Friday, February 8.
• Discussion 2 -- Due: Friday, February 15.
• Midterm Problem Set -- Due: Wednesday, February 27.
• Discussion 4 -- Due: Monday, March 25.
• Individual Problem Set 3 -- Due: Wednesday, April 10.
• Discussion 5 -- Due: Wednesday, April 17.
• Final Problem Set -- Due: no later than 5:00pm on Saturday, May 4. (I will be on campus that day to collect papers.)

Information and Announcements

• Information on Final Projects -- Reminder: Notify me of your topic choice and group membership no later than Friday, March 22.
• Final Project papers are due on Monday, April 29.

Related Links

• The Error Correcting Codes (ECC) page -- a collection of downloadable software for coding theory, plus links to other interesting pages -- maintained by Robert Morelos-Zaragosa at Sony Computer Science Labs.
• The home page of the coding theory group at Notre Dame. This has a page of links to other coding theory research centers.
• The home page of the Information Theory Society of the IEEE, the major professional organization for coding theory researchers and professionals.

Last modified: May 9, 2002