Permutation polynomials and complete permutation polynomials over F_q^3

06/15/2018
by   Yanping Wang, et al.
0

Motivated by many recent constructions of permutation polynomials over F_q^2, we study permutation polynomials over F_q^3 in terms of their coefficients. Based on the multivariate method and resultant elimination, we construct several new classes of sparse permutation polynomials over F_q^3, q=p^k, p≥3. Some of them are complete mappings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2019

Constructions and necessities of some permutation polynomials

Permutation polynomials over finite fields have important applications i...
research
12/21/2017

A Recursive Construction of Permutation Polynomials over F_q^2 with Odd Characteristic from Rédei Functions

In this paper, we construct two classes of permutation polynomials over ...
research
01/04/2022

A note on the paper arXiv:2112.14547

We give historical remarks related to arXiv:2112.14547 ("A New Method of...
research
12/21/2017

A general construction of permutation polynomials of the form (x^2^m+x+δ)^i(2^m-1)+1+x over _2^2m

Recently, there has been a lot of work on constructions of permutation p...
research
02/08/2023

An Algorithm to Enumerate Grid Signed Permutation Classes

In this paper, we present an algorithm that enumerates a certain class o...
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
03/08/2023

Six Permutation Patterns Force Quasirandomness

A sequence π_1,π_2,… of permutations is said to be "quasirandom" if the ...

Please sign up or login with your details

Forgot password? Click here to reset