Optimal Two-Dimensional Reed-Solomon Codes for Correcting Insertions and Deletions

This paper constructs explicit [n, 2]q Reed-Solomon codes that can correct from n-3 insertion and deletion errors, where the field size q is O(n^3), resolving the minimum field size needed for such codes.