Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Zhengchun Zhou is active.

Publication


Featured researches published by Zhengchun Zhou.


IEEE Transactions on Information Theory | 2008

A New Class of Sequences With Zero or Low Correlation Zone Based on Interleaving Technique

Zhengchun Zhou; Xiaohu Tang; Guang Gong

By interleaving one length-N perfect sequence or ideal sequence according to elaborate phases, a new method of construction of zero correlation zone (ZCZ) and low correlation zone (LCZ) sequence sets is presented. The resultant sequence sets are optimal or almost optimal with respect to Tang, Fan, and Matsufuji bound. Furthermore, the new method provides flexible choice for the ZCZ and LCZ lengths.


Designs, Codes and Cryptography | 2016

Linear codes with two or three weights from quadratic Bent functions

Zhengchun Zhou; Nian Li; Cuiling Fan; Tor Helleseth

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field


Discrete Mathematics | 2016

Three-weight cyclic codes and their weight distributions

Cunsheng Ding; Chunlei Li; Nian Li; Zhengchun Zhou


IEEE Transactions on Information Theory | 2013

A Family of Five-Weight Cyclic Codes and Their Weight Enumerators

Zhengchun Zhou; Cunsheng Ding; Jinquan Luo; Aixian Zhang

{\mathbb {F}}_p


IEEE Transactions on Information Theory | 2016

Linear Codes With Two or Three Weights From Weakly Regular Bent Functions

Chunming Tang; Nian Li; Yanfeng Qi; Zhengchun Zhou; Tor Helleseth


IEEE Transactions on Information Theory | 2012

New Classes of Frequency-Hopping Sequences With Optimal Partial Correlation

Zhengchun Zhou; Xiaohu Tang; Xianhua Niu; Udaya Parampalli

Fp, where p is an odd prime. They include some earlier linear codes as special cases. The weight distributions of these linear codes are also determined.


IEEE Transactions on Information Theory | 2011

New Constructions for Optimal Sets of Frequency-Hopping Sequences

Zhengchun Zhou; Xiaohu Tang; Daiyuan Peng; Udaya Parampalli

Cyclic codes have been an important topic of both mathematics and engineering for decades. They have been widely used in consumer electronics, data transmission technologies, broadcast systems, and computer applications as they have efficient encoding and decoding algorithms. The objective of this paper is to provide a survey of three-weight cyclic codes and their weight distributions. Information about the duals of these codes is also given when it is available.


IEEE Transactions on Communications | 2013

Seven Classes of Three-Weight Cyclic Codes

Zhengchun Zhou; Cunsheng Ding

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, a family of p-ary cyclic codes whose duals have three pairwise nonconjugate zeros is proposed. The weight distribution of this family of cyclic codes is determined. It turns out that the proposed cyclic codes have five nonzero weights.


IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | 2008

New Families of Optimal Zero Correlation Zone Sequences Based on Interleaved Technique and Perfect Sequences

Zhengchun Zhou; Zhen Pan; Xiaohu Tang

Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent functions and determines the weight distributions of these linear codes. It solves an open problem proposed by Ding et al. Furthermore, this paper constructs new linear codes with two or three weights and presents their weight distributions. They contain some optimal codes meeting certain bound on linear codes.


international symposium on information theory | 2016

A sharp condition for exact support recovery of sparse signals with orthogonal matching pursuit

Jinming Wen; Zhengchun Zhou; Jian Wang; Xiaohu Tang; Qun Mo

In this paper, the partial Hamming correlation properties of frequency-hopping sequences (FHSs) are discussed. The Peng-Fan bounds on sets of FHSs are generalized to the case of partial correlation. Both individual FHSs with optimal partial autocorrelation and sets of FHSs with optimal partial correlation are presented. The former has more new parameters compared with the known individual FHSs with optimal partial autocorrelation, while the later is obtained in the literature for the first time.

Collaboration


Dive into the Zhengchun Zhou's collaboration.

Top Co-Authors

Avatar

Xiaohu Tang

Southwest Jiaotong University

View shared research outputs
Top Co-Authors

Avatar

Cunsheng Ding

Hong Kong University of Science and Technology

View shared research outputs
Top Co-Authors

Avatar

Yang Yang

Southwest Jiaotong University

View shared research outputs
Top Co-Authors

Avatar

Nian Li

University of Bergen

View shared research outputs
Top Co-Authors

Avatar

Daiyuan Peng

Southwest Jiaotong University

View shared research outputs
Top Co-Authors

Avatar

Cuiling Fan

Southwest Jiaotong University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Chunming Tang

China West Normal University

View shared research outputs
Researchain Logo
Decentralizing Knowledge