Posted by: atri | November 30, 2007

Lecture 39: GS Decoder Wrap-up

In today’s lecture we finished proving the two lemmas that were stated in the last lecture. We also saw the definition of soft decoding. In the beginning of the next lecture, we will quickly see how one can generalize the GS algorithm to do soft decoding of RS codes. Then we will move on to some recent algorithmic results in list decoding.

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: