CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS

DOI10.1017/S0004972713000646MaRDI QIDQ5419385zbMATH OpenOpenAlexFDO

Authors Xiaoer Qin, Shaofang Hong

Publication date 6 June 2014

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1303.2229

zbMATH Keywords

elementary symmetric polynomiallinear translatorlinearised polynomialpermutation polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)

Abstract: In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $su{m}_{i=1}^k(L_i(x)+gamm{a}_i)h_i(B(x))$ over $$, where $L_i(x)$ and $B(x)$ are linearized polynomials. This extends a theorem of Coulter, Henderson and Matthews. Consequently, we generalize a result of Marcos by constructing permutation polynomials of the forms $xh(lambd{a}_j(x))$ and $xh(m{u}_j(x))$, where $lambd{a}_j(x)$ is the $j$-th elementary symmetric polynomial of $x,x^q,\mathrm{...},x^{q^{m-1}}$ and $$. This answers an open problem raised by Zieve in 2010. Finally, by using the linear translator, we construct the permutation polynomial of the form $L_1(x)+L_2(gamma)h(f(x))$ over $$, which extends a result of Kyureghyan.

Recommendations

• Permutation polynomials over finite fields
• Permutation polynomials over finite fields
• scientific article; zbMATH DE number 426128
• A piecewise construction of permutation polynomials over finite fields
• On permutation polynomials over finite fields
• On constructing two classes of permutation polynomials over finite fields
• Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
• Some permutation polynomials over finite fields
• On constructing permutations of finite fields

Cites work

• A note on constructing permutation polynomials
• Classes of permutation polynomials based on cyclotomy and an additive analogue
• Constructing permutations of finite fields via linear translators
• On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
• Permutation binomials over finite fields
• Permutation polynomials and applications to coding theory
• Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure
• SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS
• Specific permutation polynomials over finite fields
• When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?
• When Does a Polynomial Over a Finite Field Permute the Elements of the Field?

Cited in

(12)

• The first and second moments of reversed Dickson polynomials over finite fields
• Constructions of complete permutation polynomials
• Permutational behavior of reversed Dickson polynomials over finite fields
• Permutational behavior of reversed Dickson polynomials over finite fields. II
• Groups of permutations generated by function-linear translator pairs
• Constructing permutations of finite fields via linear translators
• Further results on permutation polynomials via linear translators
• Further study on permutation polynomials over finite fields
• New results on permutation polynomials over finite fields
• Constructing permutation polynomials from permutation polynomials of subfields
• New methods for generating permutation polynomials over finite fields
• Nilpotent linearized polynomials over finite fields, revisited

This page was built for publication: CONSTRUCTING PERMUTATION POLYNOMIALS OVER FINITE FIELDS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419385)