CSE 510C, Error Correcting Codes: Combinatorics, Algorithms and Applications


Atri Rudra
(716) 645-3180 x 117
123 Bell Hall
Office Hours:

Class Meetings

Monday, Wednesday, Friday. 10:00-10:50am
106 Talbert Hall

Course Announcement

Course Syllabus

Course Blog

We will be using a blog for the course in lieu of a course newsgroup. All announcements will be made on the blog. If you are attending the course, you must check the blog regularly (and consider subscribing to the RSS feed).


Lecture Notes

N.B. The notes marked Draft of notes have not been reviewed by me at all. I hope to get them polished by summer 2010. --Atri

Use this style file for scribing notes. To get you started, here is a sample TeX file. (Both of these have been borrowed from Venkat Guruswami's style file from his coding theory course.) Handouts

Optional Reading

Course Pre-requisites

There is no specific course pre-requisite for this course. However, some "mathematical maturity" will be essential. In particular, comfort with basics of linear algebra (vector spaces, basis, dual spaces); finite fields, field extensions and polynomials over finite fields; elementary probability; analysis of algorithms; and (some exposure to) computational complexity will be useful. Some of these topics (for example finite fields) can be learned on a need to know basis as the course progresses. Email the instructor if you have any questions on the pre-requisites.

Reference material

We will not follow any particular textbook. The closest resource is the excellent set of lecture notes for Madhu Sudan's coding theory course at MIT: Notes from 2001, 2002 and 2004.

The basic material on codes that we will discuss in initial lectures can be found in one of many textbooks (some of the standard ones are listed below), but the recent algorithmic developments and applications in computer science are not covered in any of these: Though we won't cover much information theory in this course, if your curiosity is aroused on aspects such as entropy, mutual information, capacity theorems, source coding, etc., there is the classic information theory text


The workload will be moderate: there will be no exams. The following will be the major components:

Grading Policy

Here is a rough split of grades:

Academic Honesty

I have zero tolerance for cheating and will follow the CSE Department Policies on Academic Integrity.