5 List Decodability Vs. Rate
In the previous two chapters, we have seen on the one hand that any code of distance d can be list decoded up to its Johnson radius (which is always greater than d/2). On the other hand, we have seen that, in general, the list decoding radius (for polynomial-sized lists), purely as a function of the distance of the code, cannot be larger than the Johnson radius.
KeywordsLinear Code Random Code List Size Shannon Capacity Code Family
Unable to display preview. Download preview PDF.