Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLarge classes of permutation polynomials over $mathbb{F}_{q^2}$
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Permutation polynomials (PPs) of the form $(x^{q} -x + c)^{frac{q^2 -1}{3}+1} +x$ over $mathbb{F}_{q^2}$ were presented by Li, Helleseth and Tang [Finite Fields Appl. 22 (2013) 16--23]. More recently, we have constructed PPs of the form $(x^{q} +bx + c)^{frac{q^2 -1}{d}+1} -bx$ over $mathbb{F}_{q^2}$, where $d=2, 3, 4, 6$ [Finite Fields Appl. 35 (2015) 215--230]. In this paper we concentrate our efforts on the PPs of more general form [ f(x)=(ax^{q} +bx +c)^r phi((ax^{q} +bx +c)^{(q^2 -1)/d}) +ux^{q} +vx~~text{over $mathbb{F}_{q^2}$}, ] where $a,b,c,u,v in mathbb{F}_{q^2}$, $r in mathbb{Z}^{+}$, $phi(x)in mathbb{F}_{q^2}[x]$ and $d$ is an arbitrary positive divisor of $q^2-1$. The key step is the construction of a commutative diagram with specific properties, which is the basis of the Akbary--Ghioca--Wang (AGW) criterion. By employing the AGW criterion two times, we reduce the problem of determining whether $f(x)$ permutes $mathbb{F}_{q^2}$ to that of verifying whether two more polynomials permute two subsets of $mathbb{F}_{q^2}$. As a consequence, we find a series of simple conditions for $f(x)$ to be a PP of $mathbb{F}_{q^2}$. These results unify and generalize some known classes of PPs.
rate research
Read More
In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=F_{q}+vF_{q}+v^{2}F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and present construction of formally self-dual codes over $R$. Further, we give bounds on the minimum distance of LCD codes over $F_q$ and extend these to codes over $R$.
We describe and implement an algorithm to find all post-critically finite (PCF) cubic polynomials defined over $mathbb{Q}$, up to conjugacy over $text{PGL}_2(bar{mathbb{Q}})$. We describe normal forms that classify equivalence classes of cubic polynomials while respecting the field of definition. Applying known bounds on the coefficients of post-critically bounded polynomials to these normal forms simultaneously at all places of $mathbb{Q}$, we create a finite search space of cubic polynomials over $mathbb{Q}$ that may be PCF. Using a computer search of these possibly PCF cubic polynomials, we find fifteen which are in fact PCF.
Four recursive constructions of permutation polynomials over $gf(q^2)$ with those over $gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over $gf(q^{2^ell})$ for any positive integer $ell$ with any given permutation polynomial over $gf(q)$. A generic construction of permutation polynomials over $gf(2^{2m})$ with o-polynomials over $gf(2^m)$ is also presented, and a number of new classes of permutation polynomials over $gf(2^{2m})$ are obtained.
In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.
Let $mathbb{F}_q$ denote the finite fields with $q$ elements. The permutation behavior of several classes of infinite families of permutation polynomials over finite fields have been studied in recent years. In this paper, we continue with their studies, and get some further results about the permutation properties of the permutation polynomials. Also, some new classes of permutation polynomials are constructed. For these, we alter the coefficients, exponents or the underlying fields, etc.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
