Work

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

Year: 2010

Type: preprint

Source: Electronic colloquium on computational complexity

Authors: Tali Kaufman, Shachar Lovett

Institutions: Massachusetts Institute of Technology, Weizmann Institute of Science

Language: English

Topic: Coding theory and cryptography

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W203800693

Cites: 28

Cited by: 6

Related to: 10