4 Limits to List Decodability

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


The previous chapter showed that every code of certain minimum distance has an associated “Johnson radius” which gives a lower bound on the list decoding radius (in other words, every Hamming ball of radius up to the Johnson radius has “few” codewords). This result plays an important role in the development of the subject of list decoding. Indeed, by showing that any code with large distance has large list decoding radius, it raises algorithmic questions concerning list decoding important families of codes beyond half the minimum distance.


Boolean Function Relative Distance Linear Code Cyclic Code List Size 
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