Posted by: atri | October 19, 2007

Lecture 23: Proof of a key lemma

In today’s lecture, we saw the formal statement of majority logic decoding algorithm for binary RM codes and the proof of the lemma that proves the correctness of the algorithm. We then looked at some ways to get asymptotically good binary codes from Reed-Solomon codes, which set the stage up for code concatenation.

Next lecture, we will study code concatenation in 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: