Posted by: atri | October 31, 2007

Lecture 27: Berlekamp-Welch Algorithm

In today’s lecture, we proved the correctness of the Berlekamp-Welch algorithm (using the Gemmell-Sudan description) for unique decoding of RS codes. Then we showed that it can be implemented in cubic time. We also saw that RS codes can be corrected from erausres in cubic time.

Next class (on Monday), we will study the Generalized Minimum Distance decoding algorithm due to Forney, which can correct up to half the design distance of certain concatenated code.

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: