Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915397489393664 |
|---|---|
| author | Li, Yuting Gabrys, Ryan Farnoud, Farzad |
| author_facet | Li, Yuting Gabrys, Ryan Farnoud, Farzad |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_12193 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$ Li, Yuting Gabrys, Ryan Farnoud, Farzad Information Theory G.2.1 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. |
| title | Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$ |
| topic | Information Theory G.2.1 |
| url | https://arxiv.org/abs/2506.12193 |