Constructions and necessities of some permutation polynomials

06/15/2019
by   Xiaogang Liu, et al.
0

Permutation polynomials over finite fields have important applications in many areas of science and engineering such as coding theory, cryptography, combinatorial design, etc. In this paper, we construct several new classes of permutation polynomials, and the necessities of some permutation polynomials are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2019

Some results about permutation properties of a kind of binomials over finite fields

Permutation polynomials have many applications in finite fields theory, ...
research
06/15/2018

Permutation polynomials and complete permutation polynomials over F_q^3

Motivated by many recent constructions of permutation polynomials over F...
research
04/30/2022

Local permutation polynomials and the action of e-Klenian groups

Permutation polynomials of finite fields have many applications in Codin...
research
04/27/2020

A general method for finding the compositional inverses of permutations from the AGW criterion

Permutation polynomials and their compositional inverses have wide appli...
research
12/29/2021

A New Method of Construction of Permutation Trinomials with Coefficients 1

Permutation polynomials over finite fields are an interesting and consta...
research
11/28/2018

Constructions of involutions over finite fields

An involution over finite fields is a permutation polynomial whose inver...
research
04/06/2019

Well-Rounded Lattices via Polynomials

Well-rounded lattices have been a topic of recent studies with applicati...

Please sign up or login with your details

Forgot password? Click here to reset