Posted by: atri | April 6, 2010

Lecture 32: Generalized Minimum Distance Decoding

In yesterday’s lecture we saw how in expectation we can correct up to half the design distance of some concatenated codes via the Generalized Minimum Distance decoding algorithm. This material is in lecture 28 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: