Permutation Polynomials

Authored by: Gary L. Mullen

Handbook of Combinatorial Designs

Print publication date:  November  2006
Online publication date:  November  2006

Print ISBN: 9781584885061
eBook ISBN: 9781420010541
Adobe ISBN:


 Download Chapter




For q a prime power, let F q denote the finite field containing q elements. A polynomial fF q [x] is a permutation polynomial (PP) if the function f : cf(c) from F q into itself is a permutation. Alternatively, f(x) is a PP if the equation f(x) = a has a unique solution for each aF q .

Search for more...
Back to top

Use of cookies on this website

We are using cookies to provide statistics that help us give you the best experience of our site. You can find out more in our Privacy Policy. By continuing to use the site you are agreeing to our use of cookies.