Testing of exponentially large codes, by a new extension to Weil bound for character sums

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]

Possibly Related Publications

The following publications are possibly variants of this publication: