Posted by: atri | March 27, 2011

Lecture 25:List Decoding Capacity

In Friday’s lecture, we proved that the list decoding capacity  with \rho fraction of errors is 1-H_q(\rho). The material is from Lecture 14 from Fall 2007.

Next lecture, we will quickly prove our final combinatorial result and then move on to the process of designing explicit codes and efficient (decoding) algorithms.

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: