@InProceedings{bensasson_et_al:LIPIcs.CCC.2018.24,
author = {Ben-Sasson, Eli and Kopparty, Swastik and Saraf, Shubhangi},
title = {{Worst-Case to Average Case Reductions for the Distance to a Code}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {24:1--24:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-069-9},
ISSN = {1868-8969},
year = {2018},
volume = {102},
editor = {Servedio, Rocco A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2018.24},
URN = {urn:nbn:de:0030-drops-88654},
doi = {10.4230/LIPIcs.CCC.2018.24},
annote = {Keywords: Proximity testing, Reed-Solomon codes, algebraic coding complexity}
}