Xifeng Wang

activity

20112021

k

-error Linear Complexity for

2^{n}

-periodic Binary Sequences

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing cs.CRShow all

2 papers · 1 filter

cs.CR2014

On the $k$ -error linear complexity for $p^{n}$ -periodic binary sequences via hypercube theory

Jianqin Zhou, Wanquan Liu, Guanglu Zhou

The linear complexity and the $k$ -error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimu…

cs.CR2013★ 1 cited

Structure Analysis on the $k$ -error Linear Complexity for $2^{n}$ -periodic Binary Sequences

Jianqin Zhou, Wanquan Liu, Xifeng Wang

In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for $2^{n}$ -periodic binary sequences, we first propose a decomposition based on the cub…

On the k-error linear complexity for pn-periodic binary sequences via hypercube theory

Structure Analysis on the k-error Linear Complexity for 2n-periodic Binary Sequences

On the $k$ -error linear complexity for $p^{n}$ -periodic binary sequences via hypercube theory

Structure Analysis on the $k$ -error Linear Complexity for $2^{n}$ -periodic Binary Sequences