Posted by: atri | May 1, 2013

## All chapters updated (+ proof reading scores)

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

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

Posted by: atri | May 1, 2013

## Lect 42: Wrapup

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.

Posted by: atri | May 1, 2013

## Updated Chapters 10 and 11

Posted by: atri | April 28, 2013

## Updated Chapter 9

Posted by: atri | April 28, 2013

## Lect 40+41: Folded RS codes

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.

Posted by: atri | April 28, 2013

## Updated Chapter 7 and 8

Posted by: atri | April 23, 2013

## Lect 38+39: List Decoding RS codes

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

Posted by: atri | April 17, 2013

## Lect 37: Welch-Berlekamp Algorithm

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.

Posted by: atri | April 16, 2013

## Updated Chap 6+16

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

Posted by: atri | April 15, 2013

## Lect 35+36: Achieving BSC capacity

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.)