Advertisement

13 Concluding Remarks

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

Abstract

In this work, we have addressed several fundamental questions concerning list decoding. We began in the first part with the study of certain combinatorial aspects of list decoding, and established lower and upper bounds on the number of errors correctable via list decoding, as a function of the rate and minimum distance of the code.

Preview

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