Advertisement

10 List Decoding from Erasures

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

Abstract

The last two chapters presented a thorough investigation of the question of constructions of good codes, i.e. codes of high rate, which are list decodable from a very large, and essentially the “maximum” possible, fraction of errors.

Keywords

Binary Code Linear Code List Size Outer Code Code Family 
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.

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