Tali Kaufman, Shachar Lovett. Testing of exponentially large codes, by a new extension to Weil bound for character sums. Electronic Colloquium on Computational Complexity (ECCC), 17:65, 2010. [doi]
@article{KaufmanL10,
title = {Testing of exponentially large codes, by a new extension to Weil bound for character sums},
author = {Tali Kaufman and Shachar Lovett},
year = {2010},
url = {http://eccc.hpi-web.de/report/2010/065},
tags = {testing},
researchr = {https://researchr.org/publication/KaufmanL10},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {17},
pages = {65},
}