Course Meeting Times
Lectures: 2 sessions / week, 1.5 hours / session
Prof. Madhu Sudan
This course introduces the theory of error-correcting codes to computer scientists. This theory, dating back to the works of Shannon and Hamming from the late 40's, overflows with theorems, techniques, and notions of interest to theoretical computer scientists. The course will focus on results of asymptotic and algorithmic significance. Principal topics include:
- Construction and existence results for error-correcting codes.
- Limitations on the combinatorial performance of error-correcting codes.
- Decoding algorithms.
- Applications in computer science.
6.046J and mathematical maturity.
Grading in this course will be based on four problem sets, scribe work, and possibly one term paper.
Some standard references for coding theory are listed below. We won't follow any particular one of these. But the material covered can probably be found (in some disguise or other) in any of these.
A related course offered at MIT is 6.451: Principles of Digital Communication II, taught by Dave Forney. While 6.895 and 6.451 have a fair amount of overlap the courses do have significantly different emphasis to allow for students to benefit by taking both courses.