Local permutation polynomials and the action of e-Klenian groups

04/30/2022
by   Jaime Gutierrez, et al.
0

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new family of MOLS on size a prime power.

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
08/02/2023

Permutation and local permutation polynomial of maximum degree

Let F_q be the finite field with q elements and F_q[x_1,…, x_n] the ring...
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/27/2019

On two-to-one mappings over finite fields

Two-to-one (2-to-1) mappings over finite fields play an important role i...
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
03/08/2022

Determination of a class of permutation quadrinomials

We determine all permutation polynomials over F_q^2 of the form X^r A(X^...
research
12/28/2022

Regular complete permutation polynomials over quadratic extension fields

Let r≥ 3 be any positive integer which is relatively prime to p and q^2≡...

Please sign up or login with your details

Forgot password? Click here to reset