Posted by: atri | April 12, 2011

## Lecture 32: Achieving BSC capacity-II

In yesterday’s lecture, we finished the construction of an explicit code that achieves the $\mathrm{BSC}_p$ capacity with efficient algorithms. This material was from Lecture 30 from fall 2007. We then started talking about the Berlekamp-Welch algorithm, which was from Lecture 26 from fall 2007.

Next lecture, we will continue with the Berlekamp-Welch algorithm.