Lecture 38: List Decoding algorithm for FRS codes

In Wednesday’s lecture, we saw how to get close to the list decoding capacity result for FRS codes. We did the entire proof modulo proving that Step 2 does not output too many polynomials. We’ll complete this last step today and then move on to a complexity application of complexity theory.