Abstract
This chapter, as well as the next one, explore the relation between the list decoding radius and minimum distance of a code. Understanding the relation between these parameters is useful for two reasons: (a) for several important families of codes like Reed-Solomon codes, we have precise bounds on the distance, and one can use the relation between list decoding radius and distance to understand the list decoding potential of these codes; and (b) this shows that one approach to construct good list decodable codes is to construct large distance codes, and the latter is a relatively well-studied and better understood problem. Also, historically the most significant algorithmic results on list decoding have been fueled by an attempt to decode codes whose good minimum distance highlighted their good combinatorial list decodability properties.
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). 3 Johnson-Type Bounds and Applications to List Decoding. 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_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30180-6_3
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)