On the Insdel Error-Correcting Capacities of Binary Reed–Muller Codes and Simplex Codes

Insertion-deletion (insdel for short) codes have received extensive attention due to their ability to correct synchronization errors. It is usually a very challenging problem to determine the insdel distances of linear codes. In this paper, a good lower bound on the insdel distance of a linear code with a certain algebraic structure is provided and it indeed gives an affirmative answer to an open problem proposed by Hao Chen (IEEE Transactions on Information Theory, 68(8): 5126–5132, 2022). Appl