Posted by: atri | September 28, 2007

Lecture 12: Reed-Solomon codes

In today’s lecture, we studied the Reed-Solomon codes and saw that they satisfy the Singleton bound with equality. We then revisited the bad example for half the distance bound for unique decoding under worst case errors. We briefly mentioned list decoding. Next lecture, we will study list decoding in some more detail.

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: