Linear List Decodable Edit-Correcting Codes with Rate Approaching 1
Abstract
Linear codes correcting one deletions have rate at most $1/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.
Fields of Study & Subjects
DNA and Biological Computing
Coding theory and cryptography
Error Correcting Code Techniques
Publication details
- Journal / source
- 2026 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Pages
- 1–6
- Publication date
- 1 June 2026
- Language
- EN