Putian University

output

20042026

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

39 citations

researchers with a paper here

Zhixiong Chen3 profiles14 · h 16
Chenhuang Wu2 profiles4 · h 9
Q. Ruan3 · h 8
Xiaoni Du3 · h 15
A. Klapper2 · h 23
Arne Winterhof2 · h 25
Pinhui Ke2 · h 8
Tongjiang Yan2 · h 11
Yuhua Sun2 · h 14
Zhihua Niu2 profiles2 · h 5
Bo Du1 · h 5
Chun'e Zhao1 · h 5

collaborating institutions

Northwest Normal UniversityCN3 papers
University of Chinese Academy of SciencesCN3 papers
Austrian Academy of SciencesAT2 papers
China University of Petroleum, East ChinaCN2 papers
Fujian Normal UniversityCN2 papers
International Centre for Theoretical Physics Asia-PacificCN2 papers
Johann Radon Institute for Computational and Applied MathematicsAT2 papers
Shanghai UniversityCN2 papers
University of KentuckyUS2 papers
Artificial Intelligence in Medicine (Canada)CA1 paper
Beijing Institute of TechnologyCN1 paper
Cairo UniversityEG1 paper

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)…