V. Edemskiy

activity

20122021

most citedThe linear complexity of new binary cyclotomic sequences of period

p^{n}

5 citations · 6 across the 4 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.CR2018

About the k-Error Linear Complexity over $F_{p}$ of sequences of length 2 $p$ with optimal three-level autocorrelation

Vladimir Edemskiy

We investigate the $k$ -error linear complexity over $F_{p}$ of binary sequences of length $2 p$ with optimal three-level autocorrelation. These balanced sequences are constru…

cs.CR2018

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…

About the k-Error Linear Complexity over Fp​ of sequences of length 2p with optimal three-level autocorrelation

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

About the k-Error Linear Complexity over $F_{p}$ of sequences of length 2 $p$ with optimal three-level autocorrelation

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