2013/12/04 by Michael E. Zieve, Zieve, Michael E. · 3 citations
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #cs.IT #graph theory and CDMA systems #math.CO #math.IT #math.NT #msc:05A05 #msc:11T06 #msc:11T55
paper · pdf · doi:10.48550/arxiv.1312.1325
13 pages; many new results
arxiv created 2013/12/09 · arxiv updated 2013/12/10
We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f(x) and f(x)+x induce permutations of the field, which has combinatorial consequences. We use some of our permutation polynomials to exhibit complete sets of mutually orthogonal latin squares. In addition, we solve the open problem from a recent paper by Wu and Lin, and we give simpler proofs of much more general versions of the results in two other recent papers.