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.