| A secure federated transfer learning framework Y Liu, Y Kang, C Xing, T Chen, Q Yang IEEE Intelligent Systems 35 (4), 70-82, 2020 | 656 | 2020 |
| Coding theory: a first course S Ling, C Xing Cambridge university press, 2004 | 605 | 2004 |
| Rational points on curves over finite fields: theory and applications H Niederreiter, C Xing Cambridge University Press, 2001 | 363 | 2001 |
| SPD: efficient MPC mod for dishonest majority R Cramer, I Damgård, D Escudero, P Scholl, C Xing Annual International Cryptology Conference, 769-798, 2018 | 239 | 2018 |
| Low-discrepancy sequences and global function fields with many rational places H Niederreiter, C Xing Finite Fields and their applications 2 (3), 241-273, 1996 | 233 | 1996 |
| On subfields of the Hermitian function field A Garcia, H Stichtenoth, CP Xing Compositio Mathematica 120 (2), 137-170, 2000 | 170 | 2000 |
| Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes L Jin, S Ling, J Luo, C Xing IEEE Transactions on Information Theory 56 (9), 4735-4740, 2010 | 148 | 2010 |
| On self-dual cyclic codes over finite fields Y Jia, S Ling, C Xing IEEE Transactions on Information Theory 57 (4), 2243-2251, 2011 | 144 | 2011 |
| Linear authentication codes: bounds and constructions H Wang, C Xing, R Safavi-Naini IEEE Transactions on Information Theory 49 (4), 866-872, 2003 | 130 | 2003 |
| List decoding Reed-Solomon, Algebraic-Geometric, and Gabidulin subcodes up to the Singleton bound V Guruswami, C Xing Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 122 | 2013 |
| Algebraic geometry in coding theory and cryptography H Niederreiter, C Xing Princeton University Press, 2009 | 117 | 2009 |
| Optimal locally repairable codes of distance 3 and 4 via cyclic codes Y Luo, C Xing, C Yuan IEEE Transactions on Information Theory 65 (2), 1048-1053, 2018 | 113 | 2018 |
| Secure and efficient federated transfer learning S Sharma, C Xing, Y Liu, Y Kang 2019 IEEE international conference on big data (Big Data), 2569-2576, 2019 | 111 | 2019 |
| How long can optimal locally repairable codes be? V Guruswami, C Xing, C Yuan IEEE Transactions on Information Theory 65 (6), 3662-3670, 2019 | 110 | 2019 |
| Optimal locally repairable codes via elliptic curves X Li, L Ma, C Xing IEEE Transactions on Information Theory 65 (1), 108-117, 2018 | 107 | 2018 |
| A construction of new quantum MDS codes L Jin, C Xing IEEE transactions on information theory 60 (5), 2921-2925, 2014 | 106 | 2014 |
| Quasirandom points and global function fields H Niederreiter, C Xing London Mathematical Society Lecture Note Series, 269-296, 1996 | 101 | 1996 |
| A construction of low-discrepancy sequences using global function fields C Xing, H Niederreiter Acta Arithmetica 73 (1), 87-102, 1995 | 96 | 1995 |
| New MDS self-dual codes from generalized Reed—Solomon codes L Jin, C Xing IEEE Transactions on Information Theory 63 (3), 1434-1438, 2016 | 95 | 2016 |
| Construction of optimal locally repairable codes via automorphism groups of rational function fields L Jin, L Ma, C Xing IEEE Transactions on Information Theory 66 (1), 210-221, 2019 | 90 | 2019 |
S LingNanyang Technological UniversityVerified email at ntu.edu.sg
