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]

Authors

Tali Kaufman

This author has not been identified. Look up 'Tali Kaufman' in Google

Shachar Lovett

This author has not been identified. Look up 'Shachar Lovett' in Google