English
Related papers

Related papers: A note on permutation polynomials over finite fiel…

200 papers

We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…

Number Theory · Mathematics 2022-11-10 Li-An Chen , Robert S. Coulter

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…

Discrete Mathematics · Computer Science 2022-05-03 Jaime Gutierrez , Jorge Jimenez Urroz

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

Number Theory · Mathematics 2017-04-13 Yaotsu Chang , Chong-Dao Lee , Chia-an Liu

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

Combinatorics · Mathematics 2017-01-20 Xiang-dong Hou

In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i\left({\rm Tr}_m^{mn}(x)^{t_i}+\delta\right)^{s_i}+f_1(x)$, where $1\leq i \leq k,$ $s_i$ are positive integers,…

Number Theory · Mathematics 2024-10-01 Danyao Wu , Pingzhi Yuan

Permutation polynomials (PPs) and their inverses have applications in cryptography, coding theory and combinatorial design theory. In this paper, we make a brief summary of the inverses of PPs of finite fields, and give the inverses of all…

Combinatorics · Mathematics 2020-06-08 Yanbin Zheng , Qiang Wang , Wenhong Wei

Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…

Combinatorics · Mathematics 2025-01-28 Kirpa Garg , Sartaj Ul Hasan , Pantelimon Stanica

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which…

Number Theory · Mathematics 2020-06-01 Gustavo Terra Bastos

Recently, Boole polynomials have been studied by Kim and Kim over the p-adic number field. In this paper, we consider a q-extension of Boole polynomials by using the fermionic p-adic integrals on Zp and give some new identities related to…

Number Theory · Mathematics 2014-07-14 Dae San Kim , Yu Seon Jang , Taekyn Kim , Seog-Hoon Rim

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Invariants of generalized tensor fields on a line are classified using special polynomials P_mk^(-1/lambda) introduced here for this purpose. For the case of positive characteristic, a new invariant of formal power series, a width, is…

Representation Theory · Mathematics 2007-05-23 Aleksandrs Mihailovs

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

Information Theory · Computer Science 2019-05-28 Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee , Dae Song Go , Sihem Mesnager

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

Commutative Algebra · Mathematics 2022-05-11 Nicholas Phat Nguyen

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Combinatorics · Mathematics 2021-03-26 Sergey Bereg , Brian Malouf , Linda Morales , Thomas Stanley , I. Hal Sudborough

In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper…

Number Theory · Mathematics 2024-09-16 Bidushi Sharma , Dhiren Kumar Basnet

We present a survey on Weil sums in which an additive character of a finite field $F$ is applied to a binomial whose individual terms (monomials) become permutations of $F$ when regarded as functions. Then we indicate how these Weil sums…

Number Theory · Mathematics 2018-11-20 Daniel J. Katz

Very recently, Tu et al. presented a sufficient condition about $(a_1,a_2,a_3)$, see Theorem 1.1, such that $f(x) = x^{3\cdot 2^m} + a_1 x^{2^{m+1}+1}+ a_2 x^{2^m+2} + a_3 x^3$ is a class of permutation polynomials over $\gf_{2^{n}}$ with…

Information Theory · Computer Science 2019-09-19 Kangquan Li , Longjiang Qu , Chao Li , Hao Chen

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

Combinatorics · Mathematics 2021-04-05 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh

Many-to-one mappings and permutation polynomials over finite fields have important applications in cryptography and coding theory. In this paper, we study the many-to-one property of a large class of polynomials such as $f(x) = h(a x^q + b…

Information Theory · Computer Science 2025-03-11 Yanbin Zheng , Meiying Zhang , Yanjin Ding , Zhengbang Zha , Qiang Wang

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

Number Theory · Mathematics 2022-11-28 Yu-Bo Li , Ning-Liu Wei