Metraipolis › archive › dc_bbb8b62322de
Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC — arXiv:2609.24568
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.24568
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:57:22.718Z
- SHA-256 of the archived text
063a5c43ce7e52b05c8b62a442e258f9fc9738889d8d5bcd89adc110d62eb5d0- Stable URL of this page
https://metraipolis.com/documento/dc_bbb8b62322de
How to cite
Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC — arXiv:2609.24568 — arXiv (en), https://arxiv.org/abs/2609.24568 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bbb8b62322de (Metraipolis archive dc_bbb8b62322de, sha256 063a5c43ce7e52b05c8b62a442e258f9fc9738889d8d5bcd89adc110d62eb5d0)
BibTeX
@misc{dcbbb8b62322de,
title = {Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC — arXiv:2609.24568},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.24568},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bbb8b62322de; sha256 063a5c43ce7e52b05c8b62a442e258f9fc9738889d8d5bcd89adc110d62eb5d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.24568. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that a bounded shortened region initiates decoding throughout multidimensional spatially coupled regular LDPC and MacKay--Neal (MN) codes over the binary erasure channel (BEC). In every fixed finite dimension, uniform hypercube coupling permits the coupling width and shortened region to be chosen independently of the total number $V$ of spatial positions. At fixed widths and dimension $d>1$, replacing a shortened slab by a bounded hypercube reduces the shortening fraction from order $V^{-1/d}$ to order $V^{-1}$, with the same improvement in the shortening term of the check-count rate bound. Regular LDPC codes decode below their uncoupled potential threshold. MN codes achieve capacity for every integer degree choice $\ell>r\geq2$, $g\geq2$: their actual transmitted rates tend to $r/\ell$ and their average bit-erasure probabilities under sum-product decoding vanish below $1-r/\ell$. The proof combines an endpoint-potential identity, removal of an auxiliary constraint, finite-time estimates uniform in direction, and a curvature comparison that transfers flat-boundary progress to expanding balls. For MN codes, elementary inequalities establish fixed-point positivity for all these degrees. Two-dimensional density-evolution examples illustrate the dependence on the initial shortened region; the general sufficient constants are not evaluated numerically.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.24568 — 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-09T21:44:07.482Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).