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.