Posted by: atri | April 26, 2010

Lecture 42: Wrap-up

In today’s lecture, we saw the folded Reed-Solomon codes and went through the intuitive reasoning for why these codes might have better list decodability than Reed-Solomon codes. See the CACM survey for an overview of the code and the list decoding algorithm and/or the paper if you are interested in the details.

At the end of the lecture, we very briefly looked at some topics we did not have time to cover this semester. Here is an old blog post with more details on those topics (and more).

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: