Name
Abstract | ||
|---|---|---|
Abstract We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings of small indices. As an application, we also give some general bounds for numbers of solutions of some Artin–Schreier equations and minimum weights of some dual cyclic codes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10623-015-0170-7 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Character sums,Polynomials,Finite fields,Artin–Schreier,Cyclic codes,11T24 | Wilson polynomials,Discrete mathematics,Combinatorics,Classical orthogonal polynomials,Orthogonal polynomials,Macdonald polynomials,Gegenbauer polynomials,Discrete orthogonal polynomials,Hahn polynomials,Difference polynomials,Mathematics | Journal |
Volume | Issue | ISSN |
81 | 3 | 1573-7586 |
Citations | PageRank | References |
1 | 0.37 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daqing Wan | 1 | 152 | 23.51 |
| Qiang Wang | 2 | 237 | 37.93 |