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 2018Show all

2 papers · 1 filter

cs.IT2018

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

Yuhua Sun, Tongjiang Yan, Zhixiong Chen

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on interleaving technique and Ding-Helleseth-Lam sequences (Des.…

cs.CR2018★ 10 cited

On $k$ -error linear complexity of pseudorandom binary sequences derived from Euler quotients

Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke +1

We investigate the $k$ -error linear complexity of pseudorandom binary sequences of period $p^{r}$ derived from the Euler quotients modulo $p^{r - 1}$ , a power o…

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients

On $k$ -error linear complexity of pseudorandom binary sequences derived from Euler quotients