In today’s lecture we finished talking about list recovery and soft decoding of RS codes. We then defined folded RS codes and saw an intuition for why these new codes might help push the fraction of errors beyond . I might have gone a bit fast on some portions of the lecture. Please use the comments section if you have any questions.

Next lecture, we will present a list decoding algorithm for folded RS codes and delve into its analysis. We will be using a bit of extension fields, so this is a good time to brush up your knowledge about them and irreducible polynomials. Actually, we will just use the fact that , where is an irreducible polynomial of degree is the field . The notation denotes all polynomials with coefficients from modulo the polynomial .

Your response: