1. Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions;IEEE Transactions on Information Theory;2024-07
2. Threshold Rates of Code Ensembles: Linear Is Best;IEEE Transactions on Information Theory;2024-07
3. Randomly Punctured Reed–Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. AG Codes Achieve List Decoding Capacity over Constant-Sized Fields;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Generalized GM-MDS: Polynomial Codes Are Higher Order MDS;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10