His primary scientific interests are in Discrete mathematics, Linear code, Block code, Finite field and Quantum convolutional code. His biological study spans a wide range of topics, including Combinatorics, Algebraic geometry, Class, Bounded function and Extension. His research combines List decoding and Linear code.
Chaoping Xing works mostly in the field of Block code, limiting it down to concerns involving BCH code and, occasionally, Binary code, Generalization and Forward error correction. His Finite field study incorporates themes from Upper and lower bounds and Field. His Field study combines topics in areas such as Algebraic curve, Algebraic function and Genus.
His primary areas of study are Discrete mathematics, Combinatorics, Finite field, Linear code and Block code. His study in Discrete mathematics is interdisciplinary in nature, drawing from both List decoding, Degree, Code, Algebraic geometry and Upper and lower bounds. In general Combinatorics study, his work on Dimension often relates to the realm of Omega, thereby connecting several areas of interest.
His studies in Finite field integrate themes in fields like Class and Algebraic curve, Pure mathematics, Field. His Field research is multidisciplinary, incorporating elements of Algebraic function and Genus. His Algebra research is multidisciplinary, incorporating perspectives in Coding theory and Cryptography.
His primary areas of investigation include Discrete mathematics, Combinatorics, Code, Upper and lower bounds and Construct. His work on Mod is typically connected to Electronic mail as part of general Discrete mathematics study, connecting several disciplines of science. Many of his research projects under Combinatorics are closely connected to Omega with Omega, tying the diverse disciplines of science together.
His research in Finite field intersects with topics in Multiplicative function and Field. His research integrates issues of Algebraic geometry, List decoding, Block code and Extension in his study of Code. In his study, Coding theory, Cyclic code and Dual polyhedron is inextricably linked to Gilbert–Varshamov bound, which falls within the broad field of Upper and lower bounds.
His scientific interests lie mostly in Combinatorics, Upper and lower bounds, Code, Discrete mathematics and Block code. In the field of Combinatorics, his study on Hypergraph overlaps with subjects such as Extremal graph theory. In his research, Code word is intimately related to Singleton bound, which falls under the overarching field of Upper and lower bounds.
Discrete mathematics and Linear code are frequently intertwined in his study. As a member of one scientific family, Chaoping Xing mostly works in the field of Block code, focusing on Extension and, on occasion, Elliptic curve and Generator. His research in Finite field intersects with topics in Gilbert–Varshamov bound, Algebraic geometry, Dual polyhedron and Secure multi-party computation, Computation.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Coding Theory: A First Course
Chaoping Xing;San Ling.
Rational Points on Curves Over Finite Fields: Theory and Applications
Harald Niederreiter;Chaoping Xing.
A Secure Federated Transfer Learning Framework
Yang Liu;Yan Kang;Chaoping Xing;Tianjian Chen.
IEEE Intelligent Systems (2020)
Low-Discrepancy Sequences and Global Function Fields with Many Rational Places
Harold Niederreiter;Chaoping Xing.
Finite Fields and Their Applications (1996)
On Subfields of the Hermitian Function Field
Arnaldo Garcia;Henning Stichtenoth;Chao-Ping Xing;Chao-Ping Xing.
Compositio Mathematica (2000)
On Self-Dual Cyclic Codes Over Finite Fields
Yan Jia;San Ling;Chaoping Xing.
IEEE Transactions on Information Theory (2011)
Linear authentication codes: bounds and constructions
Huaxiong Wang;Chaoping Xing;R. Safavi-Naini.
IEEE Transactions on Information Theory (2003)
Application of Classical Hermitian Self-Orthogonal MDS Codes to Quantum MDS Codes
Lingfei Jin;San Ling;Jinquan Luo;Chaoping Xing.
IEEE Transactions on Information Theory (2010)
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
Venkatesan Guruswami;Chaoping Xing.
symposium on the theory of computing (2013)
Quasirandom points and global function fields
Harald Niederreiter;Chaoping Xing.
FFA '95 Proceedings of the third international conference on Finite fields and applications (1996)
If you think any of the details on this page are incorrect, let us know.
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: