arXiv (All)
open access
On the Average List Size of VT Codes under Two Insertions or Two Deletions
Levenshtein's classical theorem shows that any code that can uniquely decode from \(t\) deletions can also uniquely decode from \(t\) insertions. This symmetry, however, does not generally hold in the list-decoding regime. Several prior results on the capacity and radii of list-decoding from inserti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect Reconstruction Cannot Show Whether Two Codebooks on a VAE's Latent Space Agree#1324613
- Monotone Erasure Codes#216781
- Polynomially larger deletion codes by linear hashing of substring counts#1014087
- Fast List Recovery of Univariate Multiplicity Codes / Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar#1188558
- Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps#1218402
Record · ID 1327017
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive