Zhixiong Chen

activity

20132023

most citedTrace representation and linear complexity of binary sequences derived from Fermat quotients

39 citations · 71 across the 21 of their papers we have counts for

collaborators

Showing 2014 · math.NTShow all

2 papers · 2 filters

math.NT2014★ 3 cited

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 $p^{r} (r > 1)$ can be uniquely decomposed as a $p$ -adic number of the form $$ \frac{u^{(p-1)p^{r-1}} -1}{p^r}\equiv a_0(u)+a_1(u)p+\ldots+…

math.NT2014★ 1 cited

Polynomial quotients: Interpolation, value sets and Waring's problem

Zhixiong Chen, Arne Winterhof

For an odd prime $p$ and an integer $w \geq 1$ , polynomial quotients $q_{p, w} (u)$ are defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~~ \mathrm{with}~~ 0 \le q_{p,w}(u)…