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

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: