default search action
Jianqin Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Jianqin Zhou, Jingkai Feng, Jinguo Liu, Cheng Xu, Yuanzheng Tian, Da Lu:
Review on research and development of planetary penetrator. J. Field Robotics 41(5): 1570-1595 (2024) - [j14]Jianqin Zhou, Sichun Yang, Xifeng Wang:
Granule description based on possible attribute analysis. Math. Found. Comput. 7(1): 70-83 (2024) - 2023
- [j13]Jianqin Zhou, Sichun Yang, Xifeng Wang:
Concept and attribute reduction based on rectangle theory of formal concept. Math. Found. Comput. 6(2): 178-189 (2023) - 2022
- [j12]Jianqin Zhou, Shu-Cherng Fang, Shan Jiang, Songdong Ju:
Optimal planar facility location with dense demands along a curve. J. Oper. Res. Soc. 73(8): 1844-1855 (2022) - 2021
- [i16]Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu:
A New Algorithm based on Extent Bit-array for Computing Formal Concepts. CoRR abs/2111.00003 (2021) - [i15]Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu:
Granule Description based on Compound Concepts. CoRR abs/2111.00004 (2021) - [i14]Jianqin Zhou, Sichun Yang, Xifeng Wang, Wanquan Liu:
Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept. CoRR abs/2111.00005 (2021) - 2020
- [c21]Lin Xu, Jianqin Zhou:
Robust Optimization of Multiple Logistics Nodes Location Problem with Curved Demands. ICMSS 2020: 245-249
2010 – 2019
- 2019
- [j11]Jianqin Zhou, Wanquan Liu, Xifeng Wang, Guanglu Zhou:
On the k-error linear complexity for pn-periodic binary sequences via hypercube theory. Math. Found. Comput. 2(4): 279-297 (2019) - 2017
- [j10]Jianqin Zhou, Wanquan Liu
, Xifeng Wang:
Complete characterization of the first descent point distribution for the k-error linear complexity of 2n-periodic binary sequences. Adv. Math. Commun. 11(3): 429-444 (2017) - 2016
- [c20]Ke Li, Jianqin Zhou:
A multi-stage location problem in route construction project management. LISS 2016: 1-6 - [c19]Lu Liu, Jianqin Zhou:
A route-like demand location problem based on squared-Euclidean distance. LISS 2016: 1-4 - 2015
- [c18]Jianqin Zhou, Wanquan Liu
The Cube Theory for 2n-Periodic Binary Sequences. FGCN 2015: 1-4 - [c17]Jianqin Zhou, Wanquan Liu
Characterization of the Third Descent Points for the k-error Linear Complexity of 2^n 2 n -periodic Binary Sequences. ICICS 2015: 169-183 - 2014
- [j9]Jianqin Zhou, Wanquan Liu
The $$k$$ -error linear complexity distribution for $$2^n$$ -periodic binary sequences. Des. Codes Cryptogr. 73(1): 55-75 (2014) - [i13]Jianqin Zhou, Wanquan Liu, Guanglu Zhou:
On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory. CoRR abs/1402.5472 (2014) - 2013
- [j8]Jianqin Zhou, Wei Xiong:
An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m. Int. J. Netw. Secur. 15(1): 59-63 (2013) - [c16]Jianqin Zhou, Wanquan Liu
Cube Theory and Stable k -Error Linear Complexity for Periodic Sequences. Inscrypt 2013: 70-85 - [i12]Jianqin Zhou, Wanquan Liu:
On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory. CoRR abs/1309.1829 (2013) - [i11]Jianqin Zhou, Jun Liu, Wanquan Liu:
The 4-error linear complexity distribution for $2^n$-periodic binary sequences. CoRR abs/1310.0132 (2013) - [i10]Jianqin Zhou, Xifeng Wang, Wanquan Liu:
Distribution of the Second Descent Points for the $k$-error Linear Complexity of $2^n$-periodic Binary Sequences. CoRR abs/1312.6927 (2013) - 2012
- [j7]Jianqin Zhou:
A counterexample concerning the 3-error linear complexity of 2 n -periodic binary sequences. Des. Codes Cryptogr. 64(3): 285-286 (2012) - 2011
- [j6]Jianqin Zhou:
An algorithm to find k-tight optimal double-loop networks. Ars Comb. 98: 423-432 (2011) - [j5]Jianqin Zhou:
On the k-error linear complexity of sequences with period 2pn over GF(q). Des. Codes Cryptogr. 58(3): 279-296 (2011) - [c15]Xuegang Chen, Jianqin Zhou:
The Research on the Interaction Effects of Rural Logistics and Economic Development. ICEIS (2) 2011: 167-171 - [i9]Jianqin Zhou, Wanquan Liu:
The $k$-error linear complexity distribution for $2^n$-periodic binary sequences. CoRR abs/1108.5793 (2011) - [i8]Jianqin Zhou:
On discrete cosine transform. CoRR abs/1109.0337 (2011) - [i7]Jianqin Zhou:
Embedding Constructions of Tail-Biting Trellises for Linear Block Codes. CoRR abs/1109.1105 (2011) - [i6]Jianqin Zhou:
Periodic sequences with stable $k$-error linear complexity. CoRR abs/1109.4455 (2011) - [i5]Jianqin Zhou, Wei Xiong:
An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$. CoRR abs/1109.4459 (2011) - [i4]Jianqin Zhou, Jun Liu, Wanquan Liu:
Characterization of $2^n$-periodic binary sequences with fixed 3-error or 4-error linear complexity. CoRR abs/1112.6047 (2011) - 2010
- [j4]Jianqin Zhou:
A Note on the Constructions of Orthomorphic Permutations. Int. J. Netw. Secur. 10(1): 57-61 (2010)
2000 – 2009
- 2009
- [j3]Jianqin Zhou:
On constructions of infinite families of k-tight optimal double-loop networks. Ars Comb. 91 (2009) - [c14]Jianqin Zhou, Wei Xiong, Zemao Zhao, Lin You:
The Tight Error Linear Complexity of Periodic Sequences. CIS (2) 2009: 197-201 - [c13]Jianqin Zhou, Cheng Shangguan, Zemao Zhao:
Computing the m-Tight Error Linear Complexity of Periodic Binary Sequences. CIS (1) 2009: 386-390 - [c12]Jianqin Zhou, Wei Xiong, Gongli Zhang:
Generalized Discrete W Transform. PACCS 2009: 446-448 - [c11]Jianqin Zhou, Ping Chen:
Generalized Discrete Cosine Transform. PACCS 2009: 449-452 - 2008
- [j2]Jianqin Zhou:
Fast Algorithms for Determining the Minimal Polynomials of Sequences with Period kn Over GF(Pm). Int. J. Netw. Secur. 7(1): 38-41 (2008) - [c10]Xiaolin Wang, Zhenxu Bian, Pengfei Wang, Jianqin Zhou:
A Fast Algorithm to Find Optimal Double-Loop Networks. CIS (2) 2008: 62-67 - [c9]Jianqin Zhou, Cheng Shangguan:
On the k-error Linear Complexity of Sequences. CIS (1) 2008: 267-271 - [c8]Jianqin Zhou, Wenjuan Wang:
On Constructions of Optimal Double-Loop Networks. ICIC (2) 2008: 766-774 - 2007
- [c7]Jianqin Zhou, Wai Ho Mow, Xiaoping Dai:
Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. AAECC 2007: 60-71 - [c6]Xiaoping Dai, Jianqin Zhou, Kaihou Wang:
An Algorithm to Find Optimal Double-Loop Networks with Non-unit Steps. APPT 2007: 352-361 - [c5]Xiaoping Dai, Jianqin Zhou, Xiaolin Wang:
Infinite Families of Optimal Double-Loop Networks. COCOA 2007: 220-229 - [c4]Xiaolin Wang, Jianqin Zhou:
Generalized Partially Bent Functions. FGCN (1) 2007: 16-21 - [c3]Jianqin Zhou, Zhenfei Xie, Tomoaki Ohtsuki:
Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. FGCN (1) 2007: 27-31 - [c2]Xiaolin Wang, Jianqin Zhou, Yubing Zang:
A note on homogeneous bent functions. SNPD (2) 2007: 138-142 - 2006
- [c1]Jianqin Zhou, Qiang Zheng:
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3). CANS 2006: 213-223 - 2005
- [i3]Jianqin Zhou, Xirong Xu:
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q). CoRR abs/cs/0512039 (2005) - [i2]Jianqin Zhou:
A fast algorithm for determining the linear complexity of periodic sequences. CoRR abs/cs/0512040 (2005) - [i1]Jianqin Zhou:
Generalized partially bent functions. CoRR abs/cs/0512041 (2005)
1990 – 1999
- 1994
- [j1]Kejie Ma, Huishan Zhou, Jianqin Zhou:
On the Ascending Star Subgraph Decomposition of Star Forests. Comb. 14(3): 307-320 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: