Posted by: atri | April 30, 2011

Lecture 39: List Decoding FRS Codes-III

On Friday, we finished proving that Guruswami’s list decoding algorithm for FRS codes can achieve list decoding capacity in polynomial time. Finally, we started talking about approximating NP-witness, which we will finish in our last lecture on Monday.

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: