Posted by: atri | February 25, 2011

Lecture 16: Reed-Solomon codes

In today’s lecture we showed that Reed-Solomon codes meet the Singleton bound (and is hence, an MDS code). We also looked at the consequence of projecting an MDS code on to a small enough subset. The former material is in Lecture 12 from Fall 07 and the latter is from Lecture 12 from Spring 2009.

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: