Qiang Wang

activity

20092026

most citedOn Inverses of Permutation Polynomials of Small Degree over Finite Fields

24 citations · 85 across the 53 of their papers we have counts for

collaborators

Showing 2017Show all

8 papers · 1 filter

math.NT2017

A Recursive Construction of Permutation Polynomials over $F_{q^{2}}$ with Odd Characteristic from Rédei Functions

Shihui Fu, Xiutao Feng, Dongdai Lin +1

In this paper, we construct two classes of permutation polynomials over $F_{q^{2}}$ with odd characteristic from rational Rédei functions. A complete characterization of the…

math.CO2017

Counting compositions over finite abelian groups

Zhicheng Gao, Andrew MacFie, Qiang Wang

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must…

cs.IT2017

On the Derivative Imbalance and Ambiguity of Functions

Shihui Fu, Xiutao Feng, Qiang Wang +1

In 2007, Carlet and Ding introduced two parameters, denoted by $N b_{F}$ and $N B_{F}$ , quantifying respectively the balancedness of general functions $F$ between finite Abelian groups a…

math.NT2017

Further results on complete permutation monomials over finite fields

Xiutao Feng, Dongdai Lin, Liping Wang +1

In this paper, we construct some new classes of complete permutation monomials with exponent $d = \frac{q ^{n} - 1}{q - 1}$ using AGW criterion (a special case). This proves two recent conj…

cs.IT2017

New Constructions of Permutation Polynomials of the Form $x^{r} h (x^{q - 1})$ over $F_{q^{2}}$

Kangquan Li, Longjiang Qu, Qiang Wang

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others.…

cs.IT2017

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^{n}$

Yuhua Sun, Qiang Wang, Tongjiang Yan +1

Let $p$ be an odd prime, $n$ a positive integer and $g$ a primitive root of $p^{n}$ . Suppose $D_{i}^{(p^{n})} = {g^{2 s + i} ∣ s = 0, 1, 2, \dots, \frac{( p - 1 ) p ^{n - 1}}{2}}$ , $i = 0, 1$ , is the general…

A Recursive Construction of Permutation Polynomials over Fq2​ with Odd Characteristic from Rédei Functions

Counting compositions over finite abelian groups

On the Derivative Imbalance and Ambiguity of Functions

Further results on complete permutation monomials over finite fields

New Constructions of Permutation Polynomials of the Form xrh(xq−1) over Fq2​

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period pn

A Recursive Construction of Permutation Polynomials over $F_{q^{2}}$ with Odd Characteristic from Rédei Functions

New Constructions of Permutation Polynomials of the Form $x^{r} h (x^{q - 1})$ over $F_{q^{2}}$

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^{n}$