New Extension of the Weil Bound for Character Sums with Applications to Coding

DOI10.1109/FOCS.2011.41zbMath1292.94177arXiv0806.4535OpenAlexW2027040874MaRDI QIDQ5495042

Tali Kaufman, Shachar Lovett

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0806.4535

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Exponential sums (11T23)

Related Items (7)

Index bounds for character sums of polynomials over finite fields ⋮ 2-transitivity is insufficient for local testability ⋮ Unnamed Item ⋮ An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding ⋮ Sparse affine-invariant linear codes are locally testable ⋮ A combinatorial characterization of smooth LTCs and applications ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

This page was built for publication: New Extension of the Weil Bound for Character Sums with Applications to Coding