19 citations · 24 across the 2 of their papers we have counts for
2 papers
cs.IT2008★ 5 cited
The List-Decoding Size of Reed-Muller Codes
Tali Kaufman, Shachar Lovett
In this work we study the list-decoding size of Reed-Muller codes. Given a received word and a distance parameter, we are interested in bounding the size of the list of Reed-Muller…
math.CO2008★ 19 cited
Worst Case to Average Case Reductions for Polynomials
Tali Kaufman, Shachar Lovett
A degree- polynomial in variables over a field $\F$ is {\em equidistributed} if it takes on each of its $|\F|$ values close to equally often, and {\em biased} otherwise.…