Posted by: atri | October 29, 2007

Lecture 26: Decoding Concatenated codes

In today’s lecture we saw how to decode concatenated codes up to \frac{1}{4}th of their design distance in polynomial time (assuming that the outer code can be decoded up to half its distance in polynomial time).

We stated the Berlekamp-Welch algorithm for such an unique decoder for Reed-Solomon codes. Next lecture, we will prove the correcteness of the algorithm along with some generalizations to error correction from a mixture of errors and erasures (which in turn will be useful for designing efficient algorithms to decode certain concatenated codes up to half their design distance).

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: