SIGACT News Complexity Theory Column 25 Lane A. Hemaspaandra Dept. of Computer Science, University of Rochester l~.ochester, NY 14627, USA l a n e ® c s . r o c h e s t e r . e d u I n t r o d u c t i o n to C o m p l e z i t y Theory C o l u m n 25 The 2000s are upon us, and your Complexity Theory C o l - m - celebrates their start with M a d h u Sudan writing on list decoding. Up next issue is Ulrich H e r t r a m p f writing on algebraic acceptance mechanisms for polynomial-time machines. Guest Column: List Decoding: Algorithms and Applications. M a d h u Sudan1 Abstract Over the years coding theory and complexity theory have benefited from a n-tuber 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 "listdecoding" for error-correcting codes. In this survey we describe the list-decoding problem, the algorithm~ that have been developed,
/lp/association-for-computing-machinery/list-decoding-algorithms-and-applications-XyqFxhnPi9