Prereq: 6.046, 6.840 & Mathematical Maturity.

Time: MW 1:00-2:30pm

Location: 66-144

3-0-9 H-Level Grad Credit

Homepage: http://theory.lcs.mit.edu/~madhu/FT01/course.html

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 or 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.

- http://theory.lcs.mit.edu/~madhu/coding/course.html : Course notes from a fast-paced version of this course
- http://theory.lcs.mit.edu/~madhu/papers/focs01-tut.ps : A recent tutorial/survey.