Chap 12, Chap 13 and Chap 14 have been updated with your comments.

Also your proof reading scores (out of a max of 30) have been uploaded to UBLearns.

I will have to wait till May 9th to assign the final wikipedia score and the final letter grades for the course.

On Monday, we finish the proof sketch for why the “root finding” step of the decoding of folded RS codes can be done in polynomial time. We then quickly went through some topics we did not have the time to cover in this course. This old blog post has some extra pointers for some of those topics.

Chap 10 and Chap 11 have been updated with your comments.

Chap 9 has been updated with your comments.

On Wed and Friday, we say the folded RS codes and how to list decode them. This material is from Chapter 14 in the book.

Chapter 7 and Chapter 8 have been updated with your comments.

On Friday and Monday, we studied list decoding algorithms for RS codes. This material was from Section 13.2 in the book.

Today we stated and proved the correctness of the Welch-Berlekamp algorithm. This material is from Section 13.1 in the book. On Friday, we will start with list decoding of RS codes.

Chapters 6 and Chapter 16 (earlier Chap 15) have been updated with your comments.

On Friday, we finish the GMD algorithm (Sec 11.3 in the book) and then we started looking the efficiently achieving BSC capacity, which we finished today. (Chap 12.)