Posted by: atri | April 25, 2011

## Lecture 37: Guruswami’s list decoding algorithm for folded RS codes

In today’s lecture, we analyzed the first version of Guruswami’s new algorithm to list decode folded RS codes (with “folding parameter” $m$) that needs relative agreement roughly $m\cdot R$. Towards the end of the lecture, we saw how we might be able to get away with agreement roughly the optimal $R$.

Next lecture, we will analyze this new version of the list decoding algorithm and then argue that in Step 2 of the algorithm we do not output too many $f(X)$.