Posted by: atri | April 29, 2011

Lecture 38: List Decoding algorithm for FRS codes

In Wednesday’s lecture, we saw how to get close to the 1-R-\epsilon list decoding capacity result for FRS codes. We did the entire proof modulo proving that Step 2 does not output too many polynomials. We’ll complete this last step today and then move on to a complexity application of complexity theory.

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: