List Decoding: Algorithms and Applications

Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of "list-decoding" for error-correcting codes. In this survey we describe the list-decoding problem, the algorithms that have been developed, and a diverse collection of applications within complexity theory.

• Type: Conference
• Year: 2000
• Where: IFIPTCS
• Authors: Madhu Sudan
• Keywords: Coding Theory, Complexity Theory, Error-Correcting Codes, IFIPTCS 2000, Theoretical Computer Science