Posted by: atri | April 14, 2011

Lecture 33: Berlekamp-Welch Algorithm

In Wednesday’s lecture, we formally presented the Berlekamp-Welch algorithm and proved its correctness. We also saw how we could use the algorithm to decode from both errors and erasures. The material is from Lecture 27 and 28 from Fall 2007.

Remember, there is no class on Friday.

On Monday, we will start with list decoding of RS codes,

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: