A GMD Decoding of Concatenated Codes

  • Venkatesan Guruswami
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3282)


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).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Venkatesan Guruswami

    There are no affiliations available

    Personalised recommendations