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

Constructing Reed–Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. Our focus in this paper is on the special case of two-dimensional RS-codes that can correct from n - 3 insdel errors, the maximal possible number of insdel errors a two-dimensional linear code can recover from. It is known (by setting k = 2 in the lower bound 10, Proposition 37) that an n , 2 q RS-code that can correct from n -3 insdel errors satisfies that q = Ω( n 3 ). On the other hand, there are several known constructions of n , 2 q RS-codes that can correct from n -3 insdel errors, where the smallest field size is q = O ( n 4 ). In this short paper, we construct n , 2 q Reed–Solomon codes that can correct n -3 insdel errors with q = O ( n 3 ), thereby resolving the minimum field size needed for such codes.