2000 character limit reached
Five Constructions of Permutation Polynomials over $\gf(q^2)$ (1511.00322v2)
Published 1 Nov 2015 in cs.IT and math.IT
Abstract: Four recursive constructions of permutation polynomials over $\gf(q2)$ with those over $\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over $\gf(q{2\ell})$ for any positive integer $\ell$ with any given permutation polynomial over $\gf(q)$. A generic construction of permutation polynomials over $\gf(2{2m})$ with o-polynomials over $\gf(2m)$ is also presented, and a number of new classes of permutation polynomials over $\gf(2{2m})$ are obtained.