Abstract
We present a proof of Proposition 11.9, restated below, which was used in the construction of linear-time binary codes from Chapter 11. The result in particular implies an efficient algorithm to decode concatenated codes up to the product bound provided there exists an efficient errors-and-erasures decoding algorithm for the outer code, and the decoding of the inner codes can also be performed efficiently (which is usually easy since the dimension of the inner code is typically small).
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
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Guruswami, V. (2004). A GMD Decoding of Concatenated 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_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-30180-6_15
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)