相关论文: Cycle types of complete mappings of finite fields

This paper is concerned with so-called index $d$ generalized cyclotomic mappings of a finite field $\mathbb{F}_q$, which are functions $\mathbb{F}_q\rightarrow\mathbb{F}_q$ that agree with a suitable monomial function $x\mapsto ax^r$ on…

The generalized cyclotomic mappings over finite fields $\mathbb{F}_{q}$ are those mappings which induce monomial functions on all cosets of an index $\ell$ subgroup $C_0$ of the multiplicative group $\mathbb{F}_{q}^{*}$. Previous research…

Let $\mathbb{F}_q$ be the finite field of order $q$ and $F=\mathbb{F}_q(x)$ the rational function field. In this paper, we give a characterization of the cyclotomic function fields $F(\Lambda_M)$ with modulus $M$, where $M \in…

Let $K$ be a finite field of characteristic $p$. We study a certain class of functions $K\rightarrow K$ that agree with an $\mathbb{F}_p$-affine function $K\rightarrow K$ on each coset of a given additive subgroup $W$ of $K$ - we call them…

We explore the connection between cyclotomic mapping permutation polynomials and permutation polynomials of the form $x^rf(x^{\frac{q-1}{l}})$ over finite fields. We present a new necessary and a new sufficient condition to verify…

The aim of this book is to show that the use of f-analytic families of finite type cycles (cycles having finitely many irreducible components, but not compact in general) in a given complex space may be useful in complex geometry, despite…

An {\em orthomorphism} over a finite field $\mathbb{F}$ is a permutation $\theta:\mathbb{F}\mapsto\mathbb{F}$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}$. The orthomorphism $\theta$ is {\em cyclotomic of…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Let $\mathbb{F}_q$ be the finite field with $q=p^s$ elements, where $p$ is an odd prime and $s$ a positive integer. In this paper, we define the function $f(X)=(cX^q+aX)(X^{q}-X)^{n-1}$, for $a,c\in\mathbb{F}_q$ and $n\geq 1$. We study the…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This…

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

$n$-to-$1$ mappings have wide applications in many areas, especially in cryptography, finite geometry, coding theory and combinatorial design. In this paper, many classes of $n$-to-$1$ mappings over finite fields are studied. First, we…

For each prime power q, we determine all polynomials over F_{q^2} of the form f(X) := aX^{3q}+bX^{2q+1}+cX^{q+2}+dX^3 which induce complete mappings of F_{q^2}, in the sense that each of the functions x --> f(x) and x --> f(x)+x permutes…

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

Cyclotomic coset is a classical notion in the theory of finite field which has wide applications in various computation problems. Let $q$ be a prime power, and $n$ be a positive integer coprime to $q$. In this paper we determine explicitly…

Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…