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.

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: