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
86 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
74 2019 Amortized complexity of information-theoretically secure MPC revisited I Cascudo, R Cramer, C Xing, C Yuan
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
43 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: 17th International Conference, TCC 2019, Nuremberg …, 2019
34 2019 Construction of optimal locally recoverable codes and connection with hypergraph C Xing, C Yuan
arXiv preprint arXiv:1811.09142, 2018
30 2018 Amortized complexity of zero-knowledge proofs revisited: Achieving linear soundness slack R Cramer, I Damgård, C Xing, C Yuan
Advances in Cryptology–EUROCRYPT 2017: 36th Annual International Conference …, 2017
25 2017 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
20 2017 List decodability of symbol-pair codes S Liu, C Xing, C Yuan
IEEE Transactions on Information Theory 65 (8), 4815-4821, 2019
14 2019 Subspace designs based on algebraic function fields V Guruswami, C Xing, C Yuan
Transactions of the American Mathematical Society 370 (12), 8757-8775, 2018
13 2018 Towards optimal robust secret sharing with security against a rushing adversary S Fehr, C Yuan
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
11 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
10 2021 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, ...
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
8 2020 A characterization of solvability for a class of networks C Yuan, HB Kan
Science China Information Sciences 55, 747-754, 2012
8 2012 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
7 2018 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 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: 18th International Conference, TCC 2020, Durham, NC …, 2020
5 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
5 2016 Construction of Optimal (r , δ)-Locally Recoverable Codes and Connection With Graph Theory C Xing, C Yuan
IEEE Transactions on Information Theory 68 (7), 4320-4328, 2022
4 2022 Asymptotic Gilbert–Varshamov bound on frequency hopping sequences X Niu, C Xing, C Yuan
IEEE Transactions on Information Theory 66 (2), 1213-1218, 2019
4 2019 
Chaoping XINGShanghai Jiaotong UniversityZweryfikowany adres z sjtu.edu.cn
