Posted by: atri | March 22, 2011

## Lecture 23: Shannon vs. Hamming

On Monday, we finished Shannon’s proof of the capacity of the $\mathrm{BSC}_p$ channel. We then compared the Shannon and Hamming setup. The material is from Lecture 11 in Fall 07.

Here is a link to an earlier post that talk about the complexity issues for MLD (and other coding problems).