|
Search the dblp DataBase
Jianqin Zhou:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jianqin Zhou, Qiang Zheng
A Fast Algorithm for Determining the Linear Complexity of Periodic Sequences over GF(3). [Citation Graph (0, 0)][DBLP] CANS, 2006, pp:213-223 [Conf]
- Kejie Ma, Huishan Zhou, Jianqin Zhou
On the Ascending Star Subgraph Decomposition of Star Forests. [Citation Graph (0, 0)][DBLP] Combinatorica, 1994, v:14, n:3, pp:307-320 [Journal]
- Xiaoping Dai, Jianqin Zhou, Kaihou Wang
An Algorithm to Find Optimal Double-Loop Networks with Non-unit Steps. [Citation Graph (0, 0)][DBLP] APPT, 2007, pp:352-361 [Conf]
- Xiaoping Dai, Jianqin Zhou, Xiaolin Wang
Infinite Families of Optimal Double-Loop Networks. [Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:220-229 [Conf]
Bent Functions and Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. [Citation Graph (, )][DBLP]
On the k-error Linear Complexity of Sequences. [Citation Graph (, )][DBLP]
A Fast Algorithm to Find Optimal Double-Loop Networks. [Citation Graph (, )][DBLP]
Computing the m-Tight Error Linear Complexity of Periodic Binary Sequences. [Citation Graph (, )][DBLP]
The Tight Error Linear Complexity of Periodic Sequences. [Citation Graph (, )][DBLP]
On Constructions of Optimal Double-Loop Networks. [Citation Graph (, )][DBLP]
A note on homogeneous bent functions. [Citation Graph (, )][DBLP]
Codes with Low Peak-to-Average Power Ratio for Multi-Code CDMA. [Citation Graph (, )][DBLP]
Generalized Partially Bent Functions. [Citation Graph (, )][DBLP]
Generalized Discrete Cosine Transform. [Citation Graph (, )][DBLP]
Generalized Discrete W Transform. [Citation Graph (, )][DBLP]
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q) [Citation Graph (, )][DBLP]
A fast algorithm for determining the linear complexity of periodic sequences [Citation Graph (, )][DBLP]
Generalized partially bent functions [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|