Abstract
In the previous chapter we presented list decoding algorithms for two widely-studied families of algebraic codes: Reed-Solomon codes and AG-codes. Owing to the importance of these codes, these results can be viewed as providing strong evidence to the general utility of list decoding as an algorithmic notion. Indeed, as we shall see in future chapters, they set the stage for a whole body of results about list decoding.
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). 7 A Unified Framework for List Decoding of Algebraic Codes. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-30180-6_7
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)