Advertisement

5 List Decodability Vs. Rate

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

Abstract

In the previous two chapters, we have seen on the one hand that any code of distance d can be list decoded up to its Johnson radius (which is always greater than d/2). On the other hand, we have seen that, in general, the list decoding radius (for polynomial-sized lists), purely as a function of the distance of the code, cannot be larger than the Johnson radius.

Keywords

Linear Code Random Code List Size Shannon Capacity 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