Posted by: atri | April 20, 2009

Lecture 37: Sudan’s List Decoding Algorithm

In today’s lecture, we formally presented Sudan’s list decoding algorithm for RS codes that can correct up to 1-\sqrt{2R} fraction of errors in polynomial time. The stuff we covered today appears in Lecture 38 from Fall 07 (the notes need to be polished).

Next lecture, which will be from 1:30pm-3:20pm in Commons 9, we will study the improvement to Sudan’s algorithm by Guruswami and Sudan that allows us to list decode RS codes from 1-\sqrt{R} fraction of errors in polynomial time. Thus, RS codes are explicit codes that can be algorithmically list decoded up to the Johnson bound.

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: