Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Guruswami, V. (2004). 5 List Decodability Vs. Rate. In: List Decoding of Error-Correcting Codes. Lecture Notes in Computer Science, vol 3282. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30180-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-30180-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24051-8
Online ISBN: 978-3-540-30180-6
eBook Packages: Computer ScienceComputer Science (R0)