Fetching the paper…
Reading the bibliography…
The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords.
List decoding for noisy channels
P. Elias · 1957
Earlier work this paper cites.
List decoding
J. Wozencraft · 1958
Earlier work this paper cites.
Probabilistic algorithms for sparse polynomials
R E. Zippel · 1979
Earlier work this paper cites.
Fast probabilistic algorithms for verification of polynomial identities
J. T. Schwartz · 1980
Earlier work this paper cites.
A hard-core predicate for all one-way functions
O. Goldreich and L. Levin · 1989
Earlier work this paper cites.
Learning decision trees using the Fourier spectrum
E. Kushilevitz and Y. Mansour · 1993
Earlier work this paper cites.
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
J. Jackson · 1997
Earlier work this paper cites.
Decoding of Reed-Solomon codes beyond the error-correction bound
M. Sudan · 1997
Earlier work this paper cites.
Quick approximation to matrices and applications
Alan M. Frieze and Ravi Kannan · 1999
Earlier work this paper cites.
Improved decoding of Reed-Solomon and Algebraic-Geometric codes
V. Guruswami and M. Sudan · 1999
Earlier work this paper cites.
Learning polynomials with queries: The highly noisy case
O. Goldreich, R. Rubinfeld, and M. Sudan · 2000
Cited alongside, same era.
List decoding: Algorithms and applications
M. Sudan · 2000
Cited alongside, same era.
Pseudorandom generators without the XOR lemma
M. Sudan, L. Trevisan, and S. P. Vadhan · 2001
Cited alongside, same era.
Extractors from Reed-Muller codes
A. Ta-Shma, D. Zuckerman, and S. Safra · 2001
Cited alongside, same era.
Proving hard-core predicates using list decoding
A. Akavia, S. Goldwasser, and S. Safra · 2003
Cited alongside, same era.
Improved low-degree testing and its applications
S. Arora and M. Sudan · 2003
Cited alongside, same era.
List-decoding using the XOR lemma
Algorithmic Results in List Decoding
V. Guruswami · 2006
Later among the works it cites.
Decodability of group homomorphisms beyond the johnson bound
Irit Dinur, Elena Grigorescu, Swastik Kopparty, and Madhu Sudan · 2008
Later among the works it cites.
List decoding Reed-Muller codes over small fields
P. Gopalan, A. Klivans, and D. Zuckerman · 2008
Later among the works it cites.
The distribution of polynomials over finite fields, with applications to the gowers norms
B. Green and T. Tao · 2009
Later among the works it cites.
Regularity, boosting, and efficiently simulating every high-entropy distribution
Luca Trevisan, Madhur Tulsiani, and Salil Vadhan · 2009
Later among the works it cites.
A Fourier-analytic approach to Reed-Muller decoding
P. Gopalan · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Trevisan · 2003
Cited alongside, same era.
List Decoding of Error-Correcting Codes
V. Guruswami · 2004
Cited alongside, same era.
List decoding of q-ary Reed-Muller codes
R. Pellikaan and X. Wu · 2004
Cited alongside, same era.
Simple extractors for all min-entropies and a new pseudorandom generator
Ronen Shaltiel and Christopher Umans · 2005
Cited alongside, same era.
Théorie des fonctions numériques simplement périodiques
Edouard Lucas
Cited in the paper.
Weight distribution and list-decoding size of Reed-Muller codes
T. Kaufman, S. Lovett, and E. Porat · 2010
Later among the works it cites.
The inverse conjecture for the Gowers norm over finite fields in low characteristic
T. Tao and T. Ziegler · 2011
Later among the works it cites.
Pseudorandomness
Salil P. Vadhan · 2012
Later among the works it cites.
Every locally characterized affine-invariant property is testable
Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, and Shachar Lovett · 2013
Later among the works it cites.