Posted by: atri | November 28, 2007

Lecture 38: Guruswami-Sudan List Decoder

In today’s lecture, we first saw Sudan’s list decoding algorithm and proved that it could correct 1-\sqrt{2R} fraction of errors for rate R Reed-Solomon codes. We then looked at the Guruswami-Sudan list decoder and proved it could correct 1-\sqrt{R} fraction of errors (modulo a couple of lemmas).

Next lecture, we will prove the lemmas mentioned above. Then we will talk about some implications for a couple of generalization of the list decoding problem. If we have time, we will start talking about some recent results in list decoding.


Leave a Reply

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

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

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s


%d bloggers like this: