Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$

Linear codes correcting one deletions have rate at most $1\mathrm{/}2$. In this paper, we construct linear list decodable codes correcting edits with rate approaching $1$ and reasonable list size. Our encoder and decoder run in polynomial time.