- [1] . IMPROVED LIST-DECODABILITY AND LIST-RECOVERABILITY OF REED-SOLOMON CODES VIA TREE PACKINGS. SIAM JOURNAL ON COMPUTING, 53, 389, 2024.
- [2] . GENERALIZED SINGLETON BOUND AND LIST-DECODING REED-SOLOMON CODES BEYOND THE JOHNSON RADIUS. SIAM JOURNAL ON COMPUTING, 52, 684, 2023.
- [3] . Singleton-type bounds for list-decoding and list-recovery, and related results. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2024.
- [4] 张晨阳. Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes. 《IEEE TRANSACTIONS ON INFORMATION THEORY》, 69, 7099-7109, 2023.
- [5] . Singleton-type bounds for list-decoding and list-recovery, and related results. 2022-June, 2565-2570, 2022.
- [6] . DEGENERATE TURAN DENSITIES OF SPARSE HYPERGRAPHS II: A SOLUTION TO THE BROWN-EROS-SOS PROBLEM FOR EVERY UNIFORMITY. SIAM JOURNAL ON DISCRETE MATHEMATICS, 37, 1920, 2023.
- [7] . List-decoding and List-recovery of Reed-Solomon Codes beyond the Johnson Radius for Every Rate. 《IEEE TRANSACTIONS ON INFORMATION THEORY》, 69, 2261-2268, 2022.
- [8] . Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. 2022-February, 708-719, 2022.
- [9] Guo, Zeyu. Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings: [Extended Abstract]. 2022-February, 708-719, 2022.
- [10] 上官冲. NEW TURAN EXPONENTS FOR TWO EXTREMAL HYPERGRAPH PROBLEMS. SIAM JOURNAL ON DISCRETE MATHEMATICS, 34, 2338, 2020.
- [11] Ge, Gennian. Sparse hypergraphs: New bounds and constructions. 《JOURNAL OF COMBINATORIAL THEORY SERIES B》, 147, 96, 2021.
|