| On list decoding of insertion and deletion errors S Liu, I Tjuawinata, C Xing arXiv preprint arXiv:1906.09705, 2019 | 21 | 2019 |
| Explicit constructions of two-dimensional reed-solomon codes in high insertion and deletion noise regime T Do Duc, S Liu, I Tjuawinata, C Xing IEEE Transactions on Information Theory 67 (5), 2808-2820, 2021 | 16 | 2021 |
| List decodability of symbol-pair codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 65 (8), 4815-4821, 2019 | 16 | 2019 |
| On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability S Liu, I Tjuawinata Finite Fields and Their Applications 73, 101841, 2021 | 12 | 2021 |
| Bounds and constructions for insertion and deletion codes S Liu, C Xing IEEE Transactions on Information Theory 69 (2), 928-940, 2022 | 9 | 2022 |
| 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 | 8 | 2018 |
| Efficiently list-decodable insertion and deletion codes via concatenation S Liu, I Tjuawinata, C Xing IEEE Transactions on Information Theory 67 (9), 5778-5790, 2021 | 7 | 2021 |
| List Decodability of Random Subcodes of Gabidulin Codes S Liu, C Xing, C Yuan IEEE Transactions on Information Theory 63 (1), 159-163, 2017 | 6 | 2017 |
| On the List Decodability of Self-orthogonal Rank Metric Codes S Liu Finite Fields and Their Applications 54, 273-287, 2018 | 4 | 2018 |
| Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy S Liu, I Tjuawinata, C Xing IEEE Transactions on Information Theory, 2024 | 3 | 2024 |
| Optimal and asymptotically good locally repairable codes via propagation rules JY Chen, S Liu, L Ma, TY Wu, C Xing IEEE Transactions on Communications, 2023 | 3 | 2023 |
| List decoding of insertion and deletion codes S Liu, I Tjuawinata, C Xing arXiv preprint arXiv:1906.09705, 2019 | 3 | 2019 |
| Maximally recoverable local repairable codes from subspace direct sum systems S Liu, C Xing IEEE Transactions on Information Theory 69 (4), 2300-2310, 2022 | 2 | 2022 |
| Maximally recoverable local reconstruction codes from subspace direct sum systems S Liu, C Xing arXiv preprint arXiv:2111.03244, 2021 | 2 | 2021 |
| Nonlinear Codes with Low Redundancy S Liu, C Xing arXiv preprint arXiv:2310.14219, 2023 | 1 | 2023 |
| Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage S Liu, C Xing, Y Zhang arXiv preprint arXiv:2307.00221, 2023 | 1 | 2023 |
| A new construction of nonlinear codes via algebraic function fields S Liu, L Ma, TY Wu, C Xing IEEE Transactions on Information Theory, 2023 | 1 | 2023 |
| List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2 S Liu, C Xing, C Yuan 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 1 | 2023 |
| Good locally repairable codes via propagation rules S Liu, L Ma, T Wu, C Xing arXiv preprint arXiv:2208.04484, 2022 | 1 | 2022 |
| Upper bounds on maximum lengths of Singleton-optimal locally repairable codes S Liu, T Wu, C Xing, C Yuan arXiv preprint arXiv:2207.05417, 2022 | 1 | 2022 |
Chaoping XINGShanghai Jiaotong UniversityVerified email at sjtu.edu.cn
