| Optimal locally repairable codes via elliptic curves X Li, L Ma, C Xing IEEE Transactions on Information Theory 65 (1), 108-117, 2018 | 125 | 2018 |
| 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 | 107 | 2019 |
| Towards a characterization of subfields of the Deligne–Lusztig function fields A Bassa, L Ma, C Xing, SL Yeo Journal of Combinatorial Theory, Series A 120 (7), 1351-1371, 2013 | 27 | 2013 |
| Construction of asymptotically good locally repairable codes via automorphism groups of function fields X Li, L Ma, C Xing IEEE Transactions on Information Theory 65 (11), 7087-7094, 2019 | 23 | 2019 |
| Constructive asymptotic bounds of locally repairable codes via function fields L Ma, C Xing IEEE Transactions on Information Theory 66 (9), 5395-5403, 2020 | 16 | 2020 |
| New families of non-Reed-Solomon MDS codes L Jin, L Ma, C Xing, H Zhou arXiv preprint arXiv:2411.14779, 2024 | 11 | 2024 |
| On subfields of the Hermitian function field involving the involution automorphism L Ma, C Xing Journal of Number Theory 198, 293-317, 2019 | 11 | 2019 |
| On automorphism groups of cyclotomic function fields over finite fields L Ma, C Xing, SL Yeo Journal of Number Theory 169, 406-419, 2016 | 11 | 2016 |
| The group structures of automorphism groups of elliptic curves over finite fields and their applications to optimal locally repairable codes L Ma, C Xing Journal of Combinatorial Theory, Series A 193, 105686, 2023 | 10 | 2023 |
| Optimal and asymptotically good locally repairable codes via propagation rules JY Chen, S Liu, L Ma, TY Wu, C Xing IEEE Transactions on Communications 71 (10), 5623-5632, 2023 | 6 | 2023 |
| Binary sequences with a low correlation via cyclotomic function fields L Jin, L Ma, C Xing IEEE Transactions on Information Theory 68 (5), 3445-3454, 2022 | 6 | 2022 |
| The asymptotic behavior of automorphism groups of function fields over finite fields L Ma, C Xing Transactions of the American Mathematical Society 372 (1), 35-52, 2019 | 5 | 2019 |
| A new construction of nonlinear codes via rational function fields L Jin, L Ma, C Xing IEEE Transactions on Information Theory 67 (2), 770-777, 2020 | 4 | 2020 |
| Binary sequences with a low correlation via cyclotomic function fields of odd characteristic X Hu, L Jin, L Ma, C Xing IEEE Transactions on Information Theory 70 (2), 1397-1407, 2023 | 3 | 2023 |
| Encoding of Algebraic Geometry Codes with Quasi-linear Complexity O (NlogN) S Li, S Liu, L Ma, Y Wan, C Xing IEEE Transactions on Information Theory, 2025 | 2 | 2025 |
| Asymptotic construction of locally repairable codes with multiple recovering sets S Li, S Liu, L Ma, Y Wan, C Xing 2024 IEEE International Symposium on Information Theory (ISIT), 2820-2825, 2024 | 2 | 2024 |
| Encoding and decoding of Reed-Muller codes with quasi-linear complexity Y Kuang, S Li, S Liu, L Ma, C Xing IEEE Transactions on Information Theory, 2025 | 1 | 2025 |
| A new family of binary sequences with low correlation via elliptic curves L Jin, L Ma, C Xing, R Zhu IEEE Transactions on Information Theory, 2025 | 1 | 2025 |
| Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound S Li, S Liu, L Ma, Y Wan, C Xing arXiv preprint arXiv:2503.05062, 2025 | 1 | 2025 |
| A new construction of nonlinear codes via algebraic function fields S Liu, L Ma, TY Wu, C Xing IEEE Transactions on Information Theory 69 (9), 5640-5647, 2023 | 1 | 2023 |