Further Results on Permutation Polynomials over Finite Fields

2013/08/27 by Pingzhi Yuan, Cunsheng Ding, Yuan, Pingzhi +1 · 3 citations
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1308.5737

openalex publication_date 2013/08/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a demonstration of the theorems, we present a number of classes of explicit permutation polynomials on \gf_q.

Citations

• Permutation polynomials and group permutation polynomials

Cited by

• Periodicity and Dynamical Systems of Dickson Polynomials in Finite Fields
• Permutation polynomials of the form x+γTr(H(x))
• Some more constructions of n-cycle permutation polynomials

Related

• Further results on some classes of permutation polynomials over finite fields
• Specific permutation polynomials over finite fields
• A note on two classes of permutation polynomials over finite fields
• New results on permutation polynomials over finite fields
• A note on permutation polynomials over finite fields