Metraipolis › archive › dc_a59bb7d3d77a
Maximal input entropy for binary two-deletion and two-insertion channels — arXiv:2611.01064
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01064
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:38:24.576Z
- SHA-256 of the archived text
46c109e1fe283eb9564720ef54ad2948a1571e8e4d1011f54f86bf7c5b7e09c8- Stable URL of this page
https://metraipolis.com/documento/dc_a59bb7d3d77a
How to cite
Maximal input entropy for binary two-deletion and two-insertion channels — arXiv:2611.01064 — arXiv (en), https://arxiv.org/abs/2611.01064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a59bb7d3d77a (Metraipolis archive dc_a59bb7d3d77a, sha256 46c109e1fe283eb9564720ef54ad2948a1571e8e4d1011f54f86bf7c5b7e09c8)
BibTeX
@misc{dca59bb7d3d77a,
title = {Maximal input entropy for binary two-deletion and two-insertion channels — arXiv:2611.01064},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01064},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a59bb7d3d77a; sha256 46c109e1fe283eb9564720ef54ad2948a1571e8e4d1011f54f86bf7c5b7e09c8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01064. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Under uniform transmission, we determine the received binary words that maximize input entropy for two-deletion and two-insertion channels. For two deletions the maximizers are exactly the two alternating words at every positive received length. For two insertions the same conclusion holds from received length five onward; we give all smaller cases and exact maximal values. The proof combines an embedding-count identity organized by runs with strict convexity estimates, and a grouping of two-position deletion masks. For every insertion radius we give the complete positive embedding histogram of an alternating received word. We also determine its three-deletion histogram for every length, and certify all three-deletion maximizers through received length twelve and all three-insertion maximizers through length eighteen by exact integer comparison. These computations give precise three-error conjectures with their small-length exceptions. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT) ; Formal Languages and Automata Theory (cs.FL); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.01064 — 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-11-03T11:05:22.342Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).