English
Related papers

Related papers: Constructions of involutions over finite fields

200 papers

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

Algebraic Geometry · Mathematics 2011-03-18 Stefan Maubach , Roel Willems

Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…

Number Theory · Mathematics 2013-11-12 Baofeng Wu

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.

Number Theory · Mathematics 2012-09-19 Qiang Wang

Interesting properties of the partitions of a finite field $\mathbb F_q$ induced by the combination of involutions and trace maps are studied. The special features of involutions of the form $\frac{u}{z}$, $u$ being a fixed element of…

Information Theory · Computer Science 2016-09-28 Michele Elia , Davide Schipani

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

Information Theory · Computer Science 2019-04-16 Irwansyah , Intan Muchtadi-Alamsyah , Aleams Barra

Let R be a ring. A construction method for flexible quadratic algebras with scalar involution over R is presented which unifies various classical constructions in the literature, in particular those to construct composition algebras.

Rings and Algebras · Mathematics 2007-05-23 S. Pumpluen

We consider four classes of polynomials over the fields $\mathbb{F}_{q^3}$, $q=p^h$, $p>3$, $f_1(x)=x^{q^2+q-1}+Ax^{q^2-q+1}+Bx$, $f_2(x)=x^{q^2+q-1}+Ax^{q^3-q^2+q}+Bx$, $f_3(x)=x^{q^2+q-1}+Ax^{q^2}-Bx$, $f_4(x)=x^{q^2+q-1}+Ax^{q}-Bx$,…

Combinatorics · Mathematics 2018-04-05 Daniele Bartoli

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over $\mathbb{F}_{2^n}$ which have explicit forms by determining…

Information Theory · Computer Science 2017-06-02 Yanping Wang , WeiGuo Zhang , Zhengbang Zha

Motivated by many recent constructions of permutation polynomials over $\mathbb{F}_{q^2}$, we study permutation polynomials over $\mathbb{F}_{q^3}$ in terms of their coefficients. Based on the multivariate method and resultant elimination,…

Number Theory · Mathematics 2018-06-18 Yanping Wang , WeiGuo Zhang , Daniele Bartoli , Qiang Wang

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

Rings and Algebras · Mathematics 2013-12-18 Kwang-Yon Kim , Ryul Kim

We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$…

Number Theory · Mathematics 2020-12-29 Yanbin Zheng , Yuyin Yu

Recently, there has been a lot of work on constructions of permutation polynomials of the form $(x^{2^m}+x+\delta)^{s}+x$ over the finite field $\F_{2^{2m}}$, especially in the case when $s$ is of the form $s=i(2^m-1)+1$ (Niho exponent). In…

Information Theory · Computer Science 2017-12-22 Libo Wang , Baofeng Wu

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…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding

Given a polynomial \( H(x) \) over \(\mathbb{F}_{q^n}\), we study permutation polynomials of the form \( x + \gamma \mathrm{Tr}(H(x)) \) over \(\mathbb{F}_{q^n}\). Let \[P_H=\{\gamma\in \mathbb{F}_{q^n} : x+\gamma \mathrm{Tr}(H(x))~\text{is…

Number Theory · Mathematics 2025-07-02 Yangcheng Li , Xuan Pang , Pingzhi Yuan , Yuanpeng Zeng

This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six…

Cryptography and Security · Computer Science 2025-08-25 Kirpa Garg , Sartaj Ul Hasan , Chunlei Li , Hridesh Kumar , Mohit Pal

Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…

Populations and Evolution · Quantitative Biology 2008-01-21 Nicholas Eriksson

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Number Theory · Mathematics 2019-07-23 José Alves Oliveira , F. E. Brochero Martínez

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

Let $f=a{\tt x} +b{\tt x}^q+{\tt x}^{2q-1}\in\Bbb F_q[{\tt x}]$. We find explicit conditions on $a$ and $b$ that are necessary and sufficient for $f$ to be a permutation polynomial of $\Bbb F_{q^2}$. This result allows us to solve a related…

Number Theory · Mathematics 2013-09-16 Xiang-dong Hou

Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…

Information Theory · Computer Science 2011-02-11 Jonghoon Ryu , Oscar Y. Takeshita