6 Reed-Solomon and Algebraic-Geometric Codes

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


The previous several chapters investigated the combinatorics of list decoding and indicated what fraction of errors one can hope to correct with small lists, as a function of the distance and rate of the code. This indicates the “combinatorial” feasibility of list decoding, but provides no way to turn this into an efficient (polynomial time) algorithm that outputs the small list of codewords that differ from a received word in a certain number of positions.


Polynomial Time Alphabet Size Weighted Degree Modular Curf Alternant Code 
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