1 citations · 2 across the 6 of their papers we have counts for
6 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…
Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept
Jianqin Zhou, Sichun Yang, Xifeng Wang +1
Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are thr…
A New Algorithm based on Extent Bit-array for Computing Formal Concepts
Jianqin Zhou, Sichun Yang, Xifeng Wang +1
The emergence of Formal Concept Analysis (FCA) as a data analysis technique has increased the need for developing algorithms which can compute formal concepts quickly. The current…
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…
Embedding Constructions of Tail-Biting Trellises for Linear Block Codes
Jianqin Zhou
In this paper, embedding construction of tail-biting trellises for linear block codes is presented. With the new approach of constructing tail-biting trellises, most of the study o…