To print higher-resolution math symbols, click the
Hi-Res Fonts for Printing button on the jsMath control panel.

jsMath
Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > WEIL BOUND:
Reports tagged with weil bound:
TR10-065 | 13th April 2010
Tali Kaufman, Shachar Lovett

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

Revisions: 1

In this work we consider linear codes which are locally testable
in a sublinear number of queries. We give the first general family
of locally testable codes of exponential size. Previous results of
this form were known only for codes of quasi-polynomial size (e.g.
Reed-Muller codes). We accomplish this by ... more >>>


TR24-069 | 8th April 2024
Swastik Kopparty, Amnon Ta-Shma, Kedem Yakirevitch

Character sums over AG codes

The Stepanov-Bombieri proof of the Hasse-Weil bound also gives non-trivial bounds on the bias of character sums over curves with small genus, for any low-degree function f that is not completely biased. For high genus curves, and in particular for curves used in AG codes over constant size fields, the ... more >>>




ISSN 1433-8092 | Imprint