Posted by: atri | April 8, 2011

## Lecture 31: Achieving BSC capacity

Today we saw how a concatenated codes with the outer and inner codes having certain properties gives a code that achieves the $\mathrm{BSC}_p$ capacity and has nearly exponentially small decoding error probability. Today’s material is from Lectures 29 and 30 from Fall 2007.

Next lecture, we will finish the proof and show that we can pick the outer code carefully to obtain an explicit code that achieves the $\mathrm{BSC}_p$ capacity. Then we will move on to the algorithm for unique decoding of Reed-Solomon codes.