24 citations · 85 across the 53 of their papers we have counts for
5 papers · 1 filter
Exponential sums with sparse polynomials over finite fields
Igor E. Shparlinski, Qiang Wang
We obtain new bounds of exponential sums modulo a prime with sparse polynomials . The bounds depend on various greatest common divisors of exp…
Hermitian dual-containing constacyclic BCH codes and related quantum codes of length
X. Zhao, X. Li, Q. Wang +1
In this paper, we study a family of constacyclic BCH codes over of length , where is a prime power, and an even integer. The…
Finding compositional inverses of permutations from the AGW criterion
Tailin Niu, Kangquan Li, Longjiang Qu +1
Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on…
A Graph Joining Greedy Approach to Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +1
Using greedy algorithms to generate de Bruijn sequences is a classical approach that has produced numerous interesting theoretical results. This paper investigates an algorithm whi…
An Efficiently Generated Family of Binary de Bruijn Sequences
Yunlong Zhu, Zuling Chang, Martianus Frederic Ezerman +1
We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function $f(x_0, x_1, \ldots, x_{n-1}) = x_0…