Local permutation polynomials and the action of e-Klenian groups
From MaRDI portal
Publication:6136708
DOI10.1016/J.FFA.2023.102261arXiv2205.00151MaRDI QIDQ6136708FDOQ6136708
Authors: Jaime Gutierrez, Jorge Jiménez Urroz 
Publication date: 31 August 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2205.00151
Orthogonal arrays, Latin squares, Room squares (05B15) Polynomials over finite fields (11T06) Subgroups of symmetric groups (20B35)
Cites Work
- Title not available (Why is that?)
- Enumeration of MOLS of small order
- Orthogonal Systems of Polynomials in Finite Fields
- Generalizations of complete mappings of finite fields and some applications
- Combinatorial characterizations of authentication codes
- Title not available (Why is that?)
- Mutually orthogonal Latin squares based on cellular automata
- On components of vectorial permutations of \(\mathbb{F}_q^n\)
- The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Permutation polynomials in several variables over finite fields
Cited In (1)
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)
