Over the years coding theory and complexity theory have bene ted 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
Abstract—A list decoding algorithm is designed for the first-order binary Reed–Muller codes of lengt...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
Coding theory is concerned with successfully transmitting data through a noisy channel and correctin...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes, quite different fr...
AbstractA wide range of problems and both old and new methods are discussed that arise when the tech...
In this work, we introduce a framework to study the effect of random operations on the combinatorial...
Error-correcting codes tackle the fundamental problem of recovering from errors during data communic...
For an error-correcting code and a distance bound, the list decoding problem is to compute all the c...
Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and...
We study the problem of list decoding with focus on the case when we have a list size limited to two...
textabstractWe investigate the list decodability of symbol-pair codes in the present paper. Firstly,...
The amount of data that we use in everyday life (social media, stock analysis, satellite communicati...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
We give a polynomial time construction of binary codes with the best currently known trade-off betwe...
Abstract—A list decoding algorithm is designed for the first-order binary Reed–Muller codes of lengt...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
Coding theory is concerned with successfully transmitting data through a noisy channel and correctin...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Recently, Wu proposed in [24] a new approach to list decoding Reed-Solomon codes, quite different fr...
AbstractA wide range of problems and both old and new methods are discussed that arise when the tech...
In this work, we introduce a framework to study the effect of random operations on the combinatorial...
Error-correcting codes tackle the fundamental problem of recovering from errors during data communic...
For an error-correcting code and a distance bound, the list decoding problem is to compute all the c...
Lower bounds on the list minimum weight and list weight are obtained for ensembles of systematic and...
We study the problem of list decoding with focus on the case when we have a list size limited to two...
textabstractWe investigate the list decodability of symbol-pair codes in the present paper. Firstly,...
The amount of data that we use in everyday life (social media, stock analysis, satellite communicati...
A central paradox of coding theory has been noted for many years, and concerns the existence and con...
We give a polynomial time construction of binary codes with the best currently known trade-off betwe...
Abstract—A list decoding algorithm is designed for the first-order binary Reed–Muller codes of lengt...
AbstractA Reed–Solomon code of length n can be list decoded using the well-known Guruswami–Sudan alg...
Coding theory is concerned with successfully transmitting data through a noisy channel and correctin...