39 citations · 71 across the 21 of their papers we have counts for
4 papers · 1 filter
Linear complexity problems of level sequences of Euler quotients and their related binary sequences
Zhihua Niu, Zhixiong Chen, Xiaoni Du
The Euler quotient modulo an odd-prime power can be uniquely decomposed as a -adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+…
Trace representation of pseudorandom binary sequences derived from Euler quotients
Zhixiong Chen, Xiaoni Du, Radwa Marzouk
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help u…
Polynomial quotients: Interpolation, value sets and Waring's problem
Zhixiong Chen, Arne Winterhof
For an odd prime and an integer , polynomial quotients are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u)…
A General Construction of Binary Sequences with Optimal Autocorrelation
Tongjiang Yan, Zhixiong Chen, Bao Li
A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes…