| 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 | 62 | 2018 |
| How long can optimal locally repairable codes be? V Guruswami, C Xing, C Yuan IEEE Transactions on Information Theory 65 (6), 3662-3670, 2019 | 55 | 2019 |
| Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan Annual International Cryptology Conference, 395-426, 2018 | 33 | 2018 |
| Efficient Information-Theoretic Secure Multiparty Computation over via Galois Rings M Abspoel, R Cramer, I Damgård, D Escudero, C Yuan Theory of Cryptography Conference, 471-501, 2019 | 26 | 2019 |
| Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack R Cramer, I Damgård, C Xing, C Yuan Annual International Conference on the Theory and Applications of …, 2017 | 25 | 2017 |
| Construction of optimal locally recoverable codes and connection with hypergraph C Xing, C Yuan arXiv preprint arXiv:1811.09142, 2018 | 22 | 2018 |
| Multipartite entangled states, symmetric matrices, and error-correcting codes K Feng, L Jin, C Xing, C Yuan IEEE Transactions on Information Theory 63 (9), 5618-5627, 2017 | 19 | 2017 |
| Subspace designs based on algebraic function fields V Guruswami, C Xing, C Yuan Transactions of the American Mathematical Society 370 (12), 8757-8775, 2018 | 11 | 2018 |
| Towards optimal robust secret sharing with security against a rushing adversary S Fehr, C Yuan Annual International Conference on the Theory and Applications of …, 2019 | 10 | 2019 |
| Beating the probabilistic lower bound on perfect hashing C Xing, C Yuan Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 33-41, 2021 | 8 | 2021 |
| List decodability of symbol-pair codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 65 (8), 4815-4821, 2019 | 8 | 2019 |
| A characterization of solvability for a class of networks C Yuan, H Kan Science China Information Sciences 55 (4), 747-754, 2012 | 8 | 2012 |
| The maximal rates and minimal decoding delay of more general complex orthogonal designs Y Li, HB Kan, C Yuan, HF Ma Science China Information Sciences 53 (9), 1826-1832, 2010 | 7 | 2010 |
| Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over M Abspoel, R Cramer, I Damgård, D Escudero, M Rambaud, C Xing, ... International Conference on the Theory and Application of Cryptology and …, 2020 | 6 | 2020 |
| List decodability of random subcodes of Gabidulin codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 63 (1), 159-163, 2016 | 6 | 2016 |
| Linear exact-repair construction of hybrid MSR codes in distributed storage systems S Liang, C Yuan, H Kan IEEE communications letters 18 (7), 1095-1098, 2014 | 6 | 2014 |
| Robust secret sharing with almost optimal share size and security against rushing adversaries S Fehr, C Yuan Theory of Cryptography Conference, 470-498, 2020 | 5 | 2020 |
| List decoding of cover metric codes up to the Singleton bound S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 64 (4), 2410-2416, 2018 | 5 | 2018 |
| A new class of rank-metric codes and their list decoding beyond the unique decoding radius C Xing, C Yuan IEEE Transactions on Information Theory 64 (5), 3394-3402, 2017 | 4 | 2017 |
| Explicit-form complex orthogonal design for space-time block codes Y Li, C Yuan, HB Kan Science China Information Sciences 56 (6), 1-10, 2013 | 4 | 2013 |
Chaoping XINGShanghai Jiaotong UniversityVerified email at sjtu.edu.cn
