9 New, Expander-Based List Decodable Codes

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


In the previous chapters, we have already seen constructions of asymptotically good codes of good rate over both large alphabets (the AG-codes from Chapter 6) and the binary alphabet (the concatenated codes from Chapter 8), that are efficiently list decodable up to a “maximum” possible radius.


Binary Code Linear Code Parity Check Matrix Alphabet Size Expander Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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