World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
34
Citations
4228
World Ranking
12270
National Ranking
1512

Overview

Zhengchun Zhou is affiliated with Southwest Jiaotong University in China and has an extensive publication record in computer science and engineering disciplines. Their work spans numerous subfields, including electrical and electronic engineering, artificial intelligence, computer networks and communications, aerospace engineering, and computer vision and pattern recognition.

Their research addresses a variety of key topics, particularly in communications and coding theory. Main themes include PAPR reduction in OFDM, coding theory and cryptography, wireless communication networks research, advanced wireless communication techniques, graph theory and CDMA systems, radar systems and signal processing, and cooperative communication and network coding.

Zhou has published in several prominent venues, with frequent contributions to arXiv (Cornell University), IEEE Transactions on Information Theory, Designs Codes and Cryptography, IEEE Transactions on Communications, and Cryptography and Communications.

Recent publications include:

  • Millimeter-wave joint radar and communication system based on photonic frequency-multiplying constant envelope LFM-OFDM, 2022, Optics Express
  • Investigations on c-(Almost) Perfect Nonlinear Functions, 2021, IEEE Transactions on Information Theory
  • Low Ambiguity Zone: Theoretical Bounds and Doppler-Resilient Sequence Design in Integrated Sensing and Communication Systems, 2022, IEEE Journal on Selected Areas in Communications
  • Full Characterization of Minimal Linear Codes as Cutting Blocking Sets, 2021, IEEE Transactions on Information Theory
  • The minimum locality of linear codes, 2022, Designs Codes and Cryptography

Zhou frequently collaborates with several researchers, including Pingzhi Fan, Avik Ranjan Adhikary, Yang Yang, Zilong Liu, and Bingsheng Shen. These collaborations have resulted in numerous joint publications and contributions to the fields of wireless communication and coding theory.

Best Publications

  • A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit

    Jinming Wen;Zhengchun Zhou;Jian Wang;Xiaohu Tang

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

    Chunming Tang;Nian Li;Yanfeng Qi;Zhengchun Zhou

  • Linear codes with two or three weights from quadratic Bent functions

    Zhengchun Zhou;Nian Li;Cuiling Fan;Tor Helleseth

  • A class of three-weight cyclic codes

    Zhengchun Zhou;Cunsheng Ding

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

    Zhengchun Zhou;Xiaohu Tang;Guang Gong

  • Three-weight cyclic codes and their weight distributions

    Cunsheng Ding;Chunlei Li;Nian Li;Zhengchun Zhou

  • The Bose and Minimum Distance of a Class of BCH Codes

    Cunsheng Ding;Xiaoni Du;Zhengchun Zhou

  • Minimal linear codes over finite fields

    Ziling Heng;Cunsheng Ding;Zhengchun Zhou

  • The dimension and minimum distance of two classes of primitive BCH codes

    Cunsheng Ding;Cuiling Fan;Zhengchun Zhou

  • New Constructions for Optimal Sets of Frequency-Hopping Sequences

    Zhengchun Zhou;Xiaohu Tang;Daiyuan Peng;U Parampalli

  • Minimal Binary Linear Codes

    Cunsheng Ding;Ziling Heng;Zhengchun Zhou

  • Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit

    Jinming Wen;Zhengchun Zhou;Zilong Liu;Ming-Jun Lai

  • New Classes of Frequency-Hopping Sequences With Optimal Partial Correlation

    Zhengchun Zhou;Xiaohu Tang;Xianhua Niu;U. Parampalli

  • Seven Classes of Three-Weight Cyclic Codes

    Zhengchun Zhou;Cunsheng Ding

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

    Zhengchun Zhou;Cunsheng Ding;Jinquan Luo;Aixian Zhang

  • Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

    Chunming Tang;Yan Qiu;Qunying Liao;Zhengchun Zhou

  • Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction

    Zhengchun Zhou;Xia Li;Chunming Tang;Cunsheng Ding

  • Sparse Signal Recovery With Minimization of 1-Norm Minus 2-Norm

    Jinming Wen;Jian Weng;Chao Tong;Chao Ren

  • The minimum locality of linear codes

    Unknown

  • A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit

    Jinming Wen;Zhengchun Zhou;Dongfang Li;Xiaohu Tang

  • Investigations on c -(Almost) Perfect Nonlinear Functions

    Sihem Mesnager;Constanza Riera;Pantelimon Stanica;Haode Yan

  • Binary cyclic codes from explicit polynomials over GF(2m)

    Cunsheng Ding;Zhengchun Zhou

Frequent Co-Authors

Xiaohu Tang
Xiaohu Tang Southwest Jiaotong University
Cunsheng Ding
Cunsheng Ding Hong Kong University of Science and Technology
Pingzhi Fan
Pingzhi Fan Southwest Jiaotong University
Tor Helleseth
Tor Helleseth University of Bergen
yong liang guan
yong liang guan Nanyang Technological University
Claude Carlet
Claude Carlet Paris 8 University
Guang Gong
Guang Gong University of Waterloo
Jian Weng
Jian Weng Jinan University
Xianfu Lei
Xianfu Lei Southwest Jiaotong University
Yong Wang
Yong Wang University of Utah

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens several flexible and rewarding educational routes. If you're looking to enter the workforce quickly, there are short certificate programs that pay well in tech fields like software support, web development, and cybersecurity. These can be a stepping stone to a technology career without a long-term commitment.

For those aiming to advance their expertise, options also include online associates degrees in computer science or IT. These programs combine affordability and accessibility, offering core knowledge to build future skills or transfer to a bachelor’s program.

If you’re considering graduate studies, the shortest masters degree options let you earn an advanced credential in as little as one year. Fast-track online master’s programs are designed for working professionals aiming to boost their credentials quickly.

Finally, tech continues to be a leading area for advanced careers. Learn about which master's degree is most in demand in usa to see how fields like computer science, data science, and engineering rank for job growth and salary.

Best Scientists Citing Zhengchun Zhou

Trending Scientists

Recently Published Articles