Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
Information Theory
2025-07-21 v2 math.IT
Abstract
Linear codes correcting one deletions have rate at most . In this paper, we construct linear list decodable codes correcting edits with rate approaching and reasonable list size. Our encoder and decoder run in polynomial time.
Keywords
Cite
@article{arxiv.2506.12193,
title = {Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$},
author = {Yuting Li and Ryan Gabrys and Farzad Farnoud},
journal= {arXiv preprint arXiv:2506.12193},
year = {2025}
}
Comments
12 pages, 0 figure