Bound for mixed exponential sums associated to binary good cyclic codes (Q2422197): Difference between revisions

Let \(F(X) = \sum_{i=1}^r a_i X^{d_i}\) be a sparse polynomial over the field of order \(2^m\) and let \(\phi\) and \(\chi\) be additive and multiplicative characters respectively. A mixed exponential sum associated to this polynomial is \(S(\chi,\phi,f) = \sum_{ x \in F_{2^m}^*} \chi(x) \phi(f(x))\). The authors improve Weil's bound for mixed exponential sums over finite fields of characteristic \(2\) and obtain a bound that depends on the number of solutions of a system of polynomial equations arising from binary cyclic codes.