On the number of solutions of certain diagonal equations over finite fields

We use character sums over finite fields to give formulas for the number of solutions of certain diagonal equations of the form a(1)x(1)(m1) + a(2)x(2)(m2) + ... + a(n)x(n)(mn) = c. We also show that if the value distribution of character sums Sigma(x is an element of Fq) chi (ax(m) + bx), a, b is an element of F-q, is known, then one can obtain the number of solutions of the system of equations {x(1) + x(2) + ... + x(n) = alpha x(1)(m) + x(2)(m) +... + x(n)(m) = beta, for some particular m. We finally apply our results to induce some facts about Waring's problems and the covering radius of certain cyclic codes. (C) 2016 Elsevier Inc. All rights reserved.