Posted by: atri | April 23, 2009

## Lecture 38: GS List Decoding algorithm

In today’s lecture, we stated and analyzed the Guruswami-Sudan list decoding algorithm for RS codes and showed that it can list decode up to $1-\sqrt{R}$ fraction of errors. The slides for today’s lecture have been uploaded. Also the material appears in the scribed notes for Lecture 38 and 39 from Fall 07 (both need to be polished).

At the end of the lecture, we defined the Folded Reed-Solomon codes. We have no class on Friday. In our last lecture on Monday, we will look at the intuition behind the algorithms for Folded RS codes that can achieve the list decoding capacity.