Posted by: atri | March 17, 2010

Lecture 23: List Decoding

Today we looked at the motivation and definition of list decoding. The material is from Lectures 12 and 13 from Fall 2007.

Here is a link to my paper that re-states Shannon’s proof to show that for random codes w.h.p. have a list size of one (assuming that the distribution over error patterns is fixed).

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: