Posted by: atri | November 5, 2007

Lecture 28: Generalized Minimum Distance Decoding

In today’s lecture we saw two randomized versions of the GMD algorithm due to Forney and saw that in expectation, it does what it needs to.

Next lecture, we will start off by presenting a deterministic GMD algorithm, which will complete our presentation on a polynomial time algorithm that decodes up to half the design distance of certain concatenated code. Then we will move on codes that achieve the BSC_p capacity with polynomial time (encoding) and decoding algorithms.

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: