Name
Title | ||
|---|---|---|
Testing of exponentially large codes, by a new extension to Weil bound for character sums |
Year | Venue | Field |
|---|---|---|
2010 | Electronic Colloquium on Computational Complexity (ECCC) | Sublinear function,Discrete mathematics,Combinatorics,Exponential function,Affine invariant,Weight distribution,Mathematics,Exponential growth |
DocType | Volume | Citations |
Journal | 17 | 5 |
PageRank | References | Authors |
0.43 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tali Kaufman | 1 | 499 | 38.33 |
| Shachar Lovett | 2 | 520 | 55.02 |