No CrossRef data available.
Published online by Cambridge University Press: 26 February 2010
Let f(x) be a polynomial of degree d over Fq, the finite field with q = pn elements. Let V(f) denote the number of distinct values of f(x), xєFq. Then, it is easy to see that

where [x] denotes the greatest integer ≤x. A polynomial for which equality is achieved in (1) is called a minimal value set polynomial. Minimal value set polynomials have been studied in [1] and [3].