3 citations · 7 across the 11 of their papers we have counts for
11 papers
Granule Description based on Compound Concepts
Jianqin Zhou, Sichun Yang, Xifeng Wang +1
Concise granule descriptions for definable granules and approaching descriptions for indefinable granules are challenging and important issues in granular computing. The concept wi…
On the -error linear complexity for -periodic binary sequences via hypercube theory
Jianqin Zhou, Wanquan Liu, Guanglu Zhou
The linear complexity and the -error linear complexity of a binary sequence are important security measures for key stream strength. By studying binary sequences with the minimu…
Structure Analysis on the -error Linear Complexity for -periodic Binary Sequences
Jianqin Zhou, Wanquan Liu, Xifeng Wang
In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for -periodic binary sequences, we first propose a decomposition based on the cub…
The 4-error linear complexity distribution for -periodic binary sequences
Jianqin Zhou, Jun Liu, Wanquan Liu
By using the sieve method of combinatorics, we study -error linear complexity distribution of -periodic binary sequences based on Games-Chan algorithm. For , the com…
On the -error linear complexity for -periodic binary sequences via Cube Theory
Jianqin Zhou, Wanquan Liu
The linear complexity and k-error linear complexity of a sequence have been used as important measures of keystream strength, hence designing a sequence with high linear complexity…
Characterization of -periodic binary sequences with fixed 3-error or 4-error linear complexity
Jianqin Zhou, Jun Liu, Wanquan Liu
The linear complexity and the -error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift regi…