Efficient Algorithms for Permutation Arrays from Permutation Polynomials

We develop algorithms for computing permutation polynomials (PPs) using normalization, so-called F-maps and G-maps, and the Hermite criterion. This allows for a more efficient computation of PPs for larger degrees and for larger finite fields. We use this to improve some lower bounds for M(n,D), the maximum number of permutations on n symbols with a pairwise Hamming distance of D.