Posted by: atri | April 16, 2010

Lecture 38: Guruswami-Sudan List Decoding Algorithm

In today’s lecture, we studied the Guruswami-Sudan algorithm that can correct RS codes of rate R up to 1-\sqrt{R} fraction of errors. The material in today’s lecture is from lecture 38 and 39 from fall 2007. In the interest of time, I rushed through the proof of the two lemmas at the end. The full proofs can be found in lecture 39 notes.

Addendum (4/19): Here is the CACM article that I have mentioned a few times in class.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: