Local permutation polynomials and the action of e-Klenian groups
From MaRDI portal
Publication:6136708
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6473829 (Why is no real title available?)
- scientific article; zbMATH DE number 3665074 (Why is no real title available?)
- scientific article; zbMATH DE number 3683715 (Why is no real title available?)
- scientific article; zbMATH DE number 1455120 (Why is no real title available?)
- scientific article; zbMATH DE number 2104834 (Why is no real title available?)
- Combinatorial characterizations of authentication codes
- Enumeration of MOLS of small order
- Generalizations of complete mappings of finite fields and some applications
- Mutually orthogonal Latin squares based on cellular automata
- On components of vectorial permutations of \(\mathbb{F}_q^n\)
- Orthogonal Systems of Polynomials in Finite Fields
- Permutation polynomials in several variables over finite fields
- The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
This page was built for publication: Local permutation polynomials and the action of e-Klenian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136708)