We pinned down the “list decoding capacity” for -ary codes as , and saw that for large this implies codes of rate list-decodable up to a fraction of errors. We recalled the Johnson bound and how it implies a way to argue about list decoding properties knowing only the distance of the code. For Reed-Solomon codes this suggests that list-decoding from a fraction of errors should be possible. This trade-off between rate and list decoding radius is best possible if one only appeals to the Johnson bound.

We then began the algorithmic segment of list decoding, setting up the stage for list decoding Reed-Solomon codes. In particular, we gave an algorithm for a toy problem where given a string which is the “mixture” of two codewords encoding polynomials and , we recover both and .

## Leave a Reply