24 citations · 85 across the 53 of their papers we have counts for
11 papers · 1 filter
Counting irreducible polynomials with prescribed coefficients over a finite field
Zhicheng Gao, Simon Kuttner, Qiang Wang
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions w…
On Inverses of Permutation Polynomials of Small Degree over Finite Fields
Yanbin Zheng, Qiang Wang, Wenhong Wei
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 inv…
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…
An asymptotic formula for the number of irreducible transformation shift registers
Stephen D. Cohen, Sartaj Ul Hasan, Daniel Panario +1
We consider the problem of enumerating the number of irreducible transformation shift registers. We give an asymptotic formula for the number of irreducible transformation shift re…
Linearized Wenger graphs
Xiwang Cao, Mei Lu, Daqing Wan +2
Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, di…
A probabilistic approach to value sets of polynomials over finite fields
Zhicheng Gao, Qiang Wang
In this paper we study the distribution of the size of the value set for a random polynomial with degree at most over a finite field . We obtain the exact proba…