Posted by: atri | May 1, 2013

Lect 42: Wrapup

On Monday, we finish the proof sketch for why the “root finding” step of the decoding of folded RS codes can be done in polynomial time. We then quickly went through some topics we did not have the time to cover in this course. This old blog post has some extra pointers for some of those topics.

Posted in lectures, spr13

«
»

Leave a Reply

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

Gravatar
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 )

Cancel

Connecting to %s

Categories

%d bloggers like this: