Abstract
In this work, we have addressed several fundamental questions concerning list decoding. We began in the first part with the study of certain combinatorial aspects of list decoding, and established lower and upper bounds on the number of errors correctable via list decoding, as a function of the rate and minimum distance of the code.
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). 13 Concluding Remarks. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-30180-6_14
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)