Posted by: atri | March 23, 2011

Lecture 24: List Decoding

In today’s lecture, we motivated and defined list decoding. The material is from lectures 12 and 13 from Fall 2007. Next lecture, we will prove the list decoding capacity result.

In the lecture today, I mentioned a result that formally shows that one can correct twice the number of (uniform) random errors than worst case errors for any code. This result formalized the intuitive explanation we saw in the lecture. You can find the proof either in the original paper or lecture notes from last year. (Warning: the lecture notes are not quite polished.)

Leave a Reply

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

You are commenting using your 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


%d bloggers like this: