Permutation polynomials over Fq2 from rational functions
Abstract
Let μq+1 denote the set of (q+1)-th roots of unity in Fq2 . We construct permutation polynomials over Fq2 by using rational functions of any degree that induce bijections either on μq+1 or between μq+1 and Fq \∞\. In particular, we generalize results from Zieve.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.