Metraipolis › archive › dc_eba2465eecc0
Lower Bounds for all List-Decodable Deletion Codes — arXiv:2609.26650
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26650
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:56:19.274Z
- SHA-256 of the archived text
a087b8d4d3e091bc3461234d8ed69acbffe806f247484daa1a4b16e294acab31- Stable URL of this page
https://metraipolis.com/documento/dc_eba2465eecc0
How to cite
Lower Bounds for all List-Decodable Deletion Codes — arXiv:2609.26650 — arXiv (en), https://arxiv.org/abs/2609.26650 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eba2465eecc0 (Metraipolis archive dc_eba2465eecc0, sha256 a087b8d4d3e091bc3461234d8ed69acbffe806f247484daa1a4b16e294acab31)
BibTeX
@misc{dceba2465eecc0,
title = {Lower Bounds for all List-Decodable Deletion Codes — arXiv:2609.26650},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26650},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eba2465eecc0; sha256 a087b8d4d3e091bc3461234d8ed69acbffe806f247484daa1a4b16e294acab31},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26650. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A length-$n$ binary $k$-deletion code is a set of binary strings such that if we delete any $k$ bits of a string, leaving a length-$(n-k)$ binary string, we can uniquely recover the codeword. In this paper, we consider $t$-list decodable deletion codes, where after $k$ bits of a codeword are deleted, we can identify a list of size at most $t$ such that the original codeword lies in the list. We prove a lower bound of $\Omega_k(2^n t\log^{1/t}n/n^{k+k/t})$ on the optimal size of a $t$-list decodable $k$-deletion code, giving a $\sqrt{\log n}$ improvement over the previously best known bounds for $2$-list decodable $2$-deletion codes [GH21] and providing the first nontrivial lower bound when $t>2$ or $k>2$. Our bound holds for all $t\leq n^k$, showing that $t=\Omega(\log n)-$list decodable deletion codes have optimal size $\Theta_k(2^n t/n^k)$, asymptotically matching the known upper bound. We also prove upper bounds on the number of common subsequences and common supersequences of a given length for any two binary strings.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Information Theory (cs.IT) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.26650 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:16:21.741Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).