Jianqin Zhou

According to our database, Jianqin Zhou authored at least 51 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Unified fast algorithms for building concept lattices.

Xifeng Wang, Jianqin Zhou, Sichun Yang

Math. Found. Comput., 2025

2024

Review on research and development of planetary penetrator.

Jianqin Zhou, Jingkai Feng, Jinguo Liu, Cheng Xu, Yuanzheng Tian, Da Lu

J. Field Robotics, August, 2024

Granule description based on possible attribute analysis.

Jianqin Zhou, Sichun Yang, Xifeng Wang

Math. Found. Comput., 2024

2023

Concept and attribute reduction based on rectangle theory of formal concept.

Jianqin Zhou, Sichun Yang, Xifeng Wang

Math. Found. Comput., 2023

2022

Optimal planar facility location with dense demands along a curve.

Jianqin Zhou, Shu-Cherng Fang, Shan Jiang, Songdong Ju

J. Oper. Res. Soc., 2022

2021

Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept.

Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu

CoRR, 2021

Granule Description based on Compound Concepts.

Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu

CoRR, 2021

A New Algorithm based on Extent Bit-array for Computing Formal Concepts.

Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu

CoRR, 2021

2020

Robust Optimization of Multiple Logistics Nodes Location Problem with Curved Demands.

Lin Xu, Jianqin Zhou

Proceedings of the ICMSS 2020: 2020 4th International Conference on Management Engineering, 2020

2019

On the k-error linear complexity for pⁿ-periodic binary sequences via hypercube theory.

Jianqin Zhou, Wanquan Liu, Xifeng Wang, Guanglu Zhou

Math. Found. Comput., 2019

2017

Complete characterization of the first descent point distribution for the k-error linear complexity of 2ⁿ-periodic binary sequences.

Jianqin Zhou, Wanquan Liu, Xifeng Wang

Adv. Math. Commun., 2017

2016

A route-like demand location problem based on squared-Euclidean distance.

Lu Liu, Jianqin Zhou

Proceedings of the International Conference on Logistics, Informatics and Service Sciences, 2016

A multi-stage location problem in route construction project management.

Ke Li, Jianqin Zhou

Proceedings of the International Conference on Logistics, Informatics and Service Sciences, 2016

2015

Characterization of the Third Descent Points for the k-error Linear Complexity of 2^n 2 n -periodic Binary Sequences.

Jianqin Zhou, Wanquan Liu, Xifeng Wang

Proceedings of the Information and Communications Security - 17th International Conference, 2015

The Cube Theory for 2n-Periodic Binary Sequences.

Jianqin Zhou, Wanquan Liu, Xifeng Wang

Proceedings of the 9th International Conference on Future Generation Communication and Networking, 2015

2014

The $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences.

Jianqin Zhou, Wanquan Liu

Des. Codes Cryptogr., 2014

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

Jianqin Zhou, Wanquan Liu, Guanglu Zhou

CoRR, 2014

2013

An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m.

Jianqin Zhou, Wei Xiong

Int. J. Netw. Secur., 2013

Distribution of the Second Descent Points for the $k$-error Linear Complexity of $2^n$-periodic Binary Sequences.

Jianqin Zhou, Xifeng Wang, Wanquan Liu

CoRR, 2013

The 4-error linear complexity distribution for $2^n$-periodic binary sequences.

Jianqin Zhou, Jun Liu, Wanquan Liu

CoRR, 2013

On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory.

Jianqin Zhou, Wanquan Liu

CoRR, 2013

Cube Theory and Stable k -Error Linear Complexity for Periodic Sequences.

Jianqin Zhou, Wanquan Liu, Guanglu Zhou

Proceedings of the Information Security and Cryptology - 9th International Conference, 2013

2012

A counterexample concerning the 3-error linear complexity of 2 n -periodic binary sequences.

Jianqin Zhou

Des. Codes Cryptogr., 2012

2011

On the <i>k</i>-error linear complexity of sequences with period 2<i>p</i>^<i>n</i> over <i>GF</i>(<i>q</i>).

Jianqin Zhou

Des. Codes Cryptogr., 2011

Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity

Jianqin Zhou, Jun Liu, Wanquan Liu

CoRR, 2011

Periodic sequences with stable $k$-error linear complexity

Jianqin Zhou

CoRR, 2011

Embedding Constructions of Tail-Biting Trellises for Linear Block Codes

Jianqin Zhou

CoRR, 2011

On discrete cosine transform

Jianqin Zhou

CoRR, 2011

An algorithm to find k-tight optimal double-loop networks.

Jianqin Zhou

Ars Comb., 2011

The Research on the Interaction Effects of Rural Logistics and Economic Development.

Xuegang Chen, Jianqin Zhou

Proceedings of the ICEIS 2011, 2011

2010

A Note on the Constructions of Orthomorphic Permutations.

Jianqin Zhou

Int. J. Netw. Secur., 2010

2009

On constructions of infinite families of k-tight optimal double-loop networks.

Jianqin Zhou

Ars Comb., 2009

Generalized Discrete W Transform.

Jianqin Zhou, Wei Xiong, Gongli Zhang

Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and Systems, 2009

Generalized Discrete Cosine Transform.

Jianqin Zhou, Ping Chen

Proceedings of the 2009 Pacific-Asia Conference on Circuits, Communications and Systems, 2009

The Tight Error Linear Complexity of Periodic Sequences.

Jianqin Zhou, Wei Xiong, Zemao Zhao, Lin You

Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009

Computing the m-Tight Error Linear Complexity of Periodic Binary Sequences.

Jianqin Zhou, Cheng Shangguan, Zemao Zhao

Proceedings of the 2009 International Conference on Computational Intelligence and Security, 2009

2008

Fast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn Over GF(Pm).

Jianqin Zhou

Int. J. Netw. Secur., 2008

On Constructions of Optimal Double-Loop Networks.

Jianqin Zhou, Wenjuan Wang

Proceedings of the Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence, 2008

On the k-error Linear Complexity of Sequences.

Jianqin Zhou, Cheng Shangguan

Proceedings of the 2008 International Conference on Computational Intelligence and Security, 2008

A Fast Algorithm to Find Optimal Double-Loop Networks.

Xiaolin Wang, Zhenxu Bian, Pengfei Wang, Jianqin Zhou

Proceedings of the 2008 International Conference on Computational Intelligence and Security, 2008

2007

A note on homogeneous bent functions.

Xiaolin Wang, Jianqin Zhou, Yubing Zang

Proceedings of the 8th ACIS International Conference on Software Engineering, 2007

Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA.

Jianqin Zhou, Zhenfei Xie, Tomoaki Ohtsuki

Proceedings of the Future Generation Communication and Networking, 2007

Generalized Partially Bent Functions.

Xiaolin Wang, Jianqin Zhou

Proceedings of the Future Generation Communication and Networking, 2007

Infinite Families of Optimal Double-Loop Networks.

Xiaoping Dai, Jianqin Zhou, Xiaolin Wang

Proceedings of the Combinatorial Optimization and Applications, 2007

An Algorithm to Find Optimal Double-Loop Networks with Non-unit Steps.

Xiaoping Dai, Jianqin Zhou, Kaihou Wang

Proceedings of the Advanced Parallel Processing Technologies, 7th International Symposium, 2007

Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA.

Jianqin Zhou, Wai Ho Mow, Xiaoping Dai

Proceedings of the Applied Algebra, 2007

2006

A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over <i>GF</i>(3).

Jianqin Zhou, Qiang Zheng

Proceedings of the Cryptology and Network Security, 5th International Conference, 2006

2005

Generalized partially bent functions

Jianqin Zhou

CoRR, 2005

A fast algorithm for determining the linear complexity of periodic sequences

Jianqin Zhou

CoRR, 2005

An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

Jianqin Zhou, Xirong Xu

CoRR, 2005

1994

On the Ascending Star Subgraph Decomposition of Star Forests.

Kejie Ma, Huishan Zhou, Jianqin Zhou

Comb., 1994