Posted by: atri | April 11, 2010

Lecture 34: Achieving BSC Capacity

In the 2pm lecture on Friday, we finished the construction of an explicit code that achieves the \mathrm{BSC}_p capacity, along with polynomial time decoding algorithm. This material is from lecture 30 from fall 2007.

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: