Pinhui Ke

activity

20172019

most citedOn

k

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

10 citations · 12 across the 4 of their papers we have counts for

collaborators

Showing cs.CRShow all

3 papers · 1 filter

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…

cs.CR2017★ 2 cited

A further study on the linear complexity of new binary cyclotomic sequence of length $p^{r}$

Zhifan Ye, Pinhui Ke, Chenhuang Wu

Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period $p^{r}$ was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI…

cs.CR2017

On error linear complexity of new generalized cyclotomic binary sequences of period $p^{2}$

Chenhuang Wu, Chunxiang Xu, Zhixiong Chen +1

We consider the $k$ -error linear complexity of a new binary sequence of period $p^{2}$ , proposed in the recent paper "New generalized cyclotomic binary sequences of period $p^{2}$ ", by…

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

A further study on the linear complexity of new binary cyclotomic sequence of length pr

On error linear complexity of new generalized cyclotomic binary sequences of period p2

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

A further study on the linear complexity of new binary cyclotomic sequence of length $p^{r}$

On error linear complexity of new generalized cyclotomic binary sequences of period $p^{2}$