Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A general construction of regular complete permutation polynomials (2212.12869v1)

Published 25 Dec 2022 in cs.IT, math.IT, and math.NT

Abstract: Let $r\geq 3$ be a positive integer and $\mathbb{F}q$ the finite field with $q$ elements. In this paper, we consider the $r$-regular complete permutation property of maps with the form $f=\tau\circ\sigma_M\circ\tau{-1}$ where $\tau$ is a PP over an extension field $\mathbb{F}{qd}$ and $\sigma_M$ is an invertible linear map over $\mathbb{F}_{qd}$. We give a general construction of $r$-regular PPs for any positive integer $r$. When $\tau$ is additive, we give a general construction of $r$-regular CPPs for any positive integer $r$. When $\tau$ is not additive, we give many examples of regular CPPs over the extension fields for $r=3,4,5,6,7$ and for arbitrary odd positive integer $r$. These examples are the generalization of the first class of $r$-regular CPPs constructed by Xu, Zeng and Zhang (Des. Codes Cryptogr. 90, 545-575 (2022)).

Citations (2)

Summary

We haven't generated a summary for this paper yet.