Posted by: atri | April 7, 2010

## Lecture 33: Derandomized GMD Decoding

In today’s lecture, we saw how to derandomize the GMD algorithm we saw last time: we first came up with an intermediate randomized GMD algorithm (which can be found in lecture 28 from fall 2007) and then derandomized the intermediate version.

We then setup the stage for explicit codes that achieve the $\mathrm{BSC}_p$ capacity along with efficient decoding algorithm.

The rest of today’s material is from lecture 29 from fall 2007.