Madhu Sudan: Course Notes on Coding Theory
I have taught two different variants of a course on coding theory. Main difference is the pace at which they were taught. Pointers below.
A Crash Course on Coding Theory: These are slides developed for a ten lecture mini-course on coding theory that was taught at IBM’s Thomas J. Watson Research Center (January 2000) and at IBM’s Almaden Research Center, San Jose, California (November 2000, Co-hosted by IBM and DIMACS).
These are slides developed for a mini-course on coding theory that was taught at IBM’s Thomas J. Watson Research Center (January 2000) and at IBM’s Almaden Research Center, San Jose, California (November 2000, Co-hosted by IBM and DIMACS).
- Lecture 1: Introduction
- Lecture 2: Basic codes and constructions
- Lecture 3: Algebraic Geometry Codes
- Lecture 4: Limits on Performance of Codes
- Lecture 5: Algebraic (unique) decoding
- Lecture 6: Algebraic (list) decoding
- Lecture 7: Linear time decoding
- Lecture 8: Decoding from random errors and erasures
- Lecture 9: Applications in complexity theory
- Lecture 10: Complexity results in coding theory
Algorithmic Introduction to Coding Theory: This is the home page for a course I taught at MIT in Fall 2001. (Addendum in Fall 2002: I am teaching essentially the same course again this term. See Essential Coding Theory. for notes of the newer version.)