Posted by: atri | April 11, 2010

Lecture 35: Berlekamp-Welch Algorithm

In the 5pm lecture on Friday, we saw the Berlekamp-Welch unique decoder for Reed-Solomon codes and the analysis of its correctness. This material is in lecture 26 and 27 from fall 2007.

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: