World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
43
Citations
7393
World Ranking
1699
National Ranking
94

Overview

Chaoping Xing is affiliated with Shanghai Jiao Tong University in China. Their research primarily focuses on computer science, with particular emphasis on artificial intelligence, computer networks and communications, computational theory and mathematics, electrical and electronic engineering, and molecular biology.

The scientist's work spans multiple specialized topics, including coding theory and cryptography, cryptography and data security, advanced data storage technologies, graph theory and CDMA systems, DNA and biological computing, complexity and algorithms in graphs, and cellular automata and applications.

Chaoping Xing has contributed extensively to academic literature, with numerous publications in prominent venues. The most frequent publication outlets include:

  • IEEE Transactions on Information Theory (24 publications)
  • arXiv (Cornell University) (22 publications)
  • COMBINATORICA (2 publications)
  • IEEE Transactions on Communications (2 publications)
  • IEEE Intelligent Systems (1 publication)

Recent notable papers by Chaoping Xing include:

  • A Secure Federated Transfer Learning Framework, 2020, IEEE Intelligent Systems
  • Biometric key generation based on generated intervals and two-layer error correcting technique, 2020, Pattern Recognition
  • Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields, 2020, IEEE Transactions on Information Theory
  • A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields, 2020, IEEE Transactions on Information Theory
  • Decoding willingness to buy in live-streaming retail: The application of stimulus organism response model using PLS-SEM and SEM-ANN, 2025, Journal of Retailing and Consumer Services

Frequent collaborators in Chaoping Xing's research include Chen Yuan, Liming Ma, Shu Liu, Lingfei Jin, and Ivan Tjuawinata. These coauthors have contributed multiple joint publications, reflecting ongoing collaborative efforts within their fields of study.

Best Publications

  • A Secure Federated Transfer Learning Framework

    Yang Liu;Yan Kang;Chaoping Xing;Tianjian Chen

  • Coding Theory: A First Course

    Chaoping Xing;San Ling

  • Rational Points on Curves Over Finite Fields: Theory and Applications

    Harald Niederreiter;Chaoping Xing

  • Low-Discrepancy Sequences and Global Function Fields with Many Rational Places

    Harold Niederreiter;Chaoping Xing

  • On Subfields of the Hermitian Function Field

    Arnaldo Garcia;Henning Stichtenoth;Chao-Ping Xing;Chao-Ping Xing

  • Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes

    Lingfei Jin;San Ling;Jinquan Luo;Chaoping Xing

  • On Self-Dual Cyclic Codes Over Finite Fields

    Yan Jia;San Ling;Chaoping Xing

  • Linear authentication codes: bounds and constructions

    Huaxiong Wang;Chaoping Xing;R. Safavi-Naini

  • List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound

    Venkatesan Guruswami;Chaoping Xing

  • A Construction of New Quantum MDS Codes

    Lingfei Jin;Chaoping Xing

  • Optimal Locally Repairable Codes Via Elliptic Curves

    Xudong Li;Liming Ma;Chaoping Xing

  • Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes

    Yuan Luo;Chaoping Xing;Chen Yuan

  • How Long Can Optimal Locally Repairable Codes Be

    Venkatesan Guruswami;Chaoping Xing;Chen Yuan

  • New MDS Self-Dual Codes From Generalized Reed—Solomon Codes

    Lingfei Jin;Chaoping Xing

  • Algebraic Geometry in Coding Theory and Cryptography

    Harald Niederreiter;Chaoping Xing

  • A construction of low-discrepancy sequences using global function fields

    Chaoping Xing;Harald Niederreiter

  • Quasirandom points and global function fields

    Harald Niederreiter;Chaoping Xing

  • Quantum codes from concatenated algebraic-geometric codes

    Hao Chen;San Ling;Chaoping Xing

  • Asymmetric Quantum Codes: Characterization and Constructions

    Long Wang;Keqin Feng;San Ling;Chaoping Xing

  • SPD\(\mathbb {Z}_{2^k}\): Efficient MPC mod \(2^k\) for Dishonest Majority

    Ronald Cramer;Ivan Damgård;Daniel Escudero;Peter Scholl

  • SPDℤ 2 k : Efficient MPC mod 2 k for Dishonest Majority.

    Ronald Cramer;Ivan Damgård;Daniel Escudero;Peter Scholl

Frequent Co-Authors

Harald Niederreiter
Harald Niederreiter Austrian Academy of Sciences
San Ling
San Ling Nanyang Technological University
Venkatesan Guruswami
Venkatesan Guruswami University of California, Berkeley
Ronald Cramer
Ronald Cramer Leiden University
Huaxiong Wang
Huaxiong Wang Nanyang Technological University
Cunsheng Ding
Cunsheng Ding Hong Kong University of Science and Technology
Ivan Damgård
Ivan Damgård Aarhus University
Henning Stichtenoth
Henning Stichtenoth Sabancı University
Tor Helleseth
Tor Helleseth University of Bergen
P.V. Kumar
P.V. Kumar Indian Institute of Science

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

Studying mathematics in the USA opens up diverse opportunities beyond traditional academic routes. Many graduates pursue specialized fields such as data science and analytics, where mastering data-driven decision-making is crucial. For those interested, exploring data analysis programs can provide practical skills and certifications that enhance employability in tech and finance sectors.

Alternatively, combining a strong mathematical foundation with business acumen is a popular path. Online MBA degrees offer flexibility for working professionals, with several options recognized for accessibility. If convenience matters, researching the easiest MBA programs to get into can help identify programs that balance quality with manageable admission requirements. Similarly, the easiest MBA program choices cater to those seeking efficient pathways to leadership roles.

For advanced careers in business research and administration, pursuing a Doctorate in Business Administration (DBA) online offers a blend of academic rigor and practical focus. Candidates should consider the DBA online programs that provide affordability without compromising quality. By aligning mathematical expertise with these online degrees, students can unlock versatile career pathways in analytics, management, and beyond.

Best Scientists Citing Chaoping Xing

Trending Scientists