Metraipolis › archive › dc_d47275bb4735
Spatially Coupled MacKay-Neal Codes Achieve Capacity on BMS Channels at Fixed Degrees — arXiv:2609.15526
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.15526
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:34:46.457Z
- SHA-256 of the archived text
4facdd8efdf3873e90733969e2becac4bbad48e8f701d338a8057591c0465482- Stable URL of this page
https://metraipolis.com/documento/dc_d47275bb4735
How to cite
Spatially Coupled MacKay-Neal Codes Achieve Capacity on BMS Channels at Fixed Degrees — arXiv:2609.15526 — arXiv (en), https://arxiv.org/abs/2609.15526 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d47275bb4735 (Metraipolis archive dc_d47275bb4735, sha256 4facdd8efdf3873e90733969e2becac4bbad48e8f701d338a8057591c0465482)
BibTeX
@misc{dcd47275bb4735,
title = {Spatially Coupled MacKay-Neal Codes Achieve Capacity on BMS Channels at Fixed Degrees — arXiv:2609.15526},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.15526},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d47275bb4735; sha256 4facdd8efdf3873e90733969e2becac4bbad48e8f701d338a8057591c0465482},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15526. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish two degree-dependent results for spatially coupled MacKay-Neal codes on binary-input memoryless symmetric channels. The ensembles use uniform random smoothing and shorten both variable types outside the active chain. For $r=g=3$, every integer $\ell\geq4$, and each channel of capacity greater than $R=r/\ell$, there is a sequence of code realizations whose actual transmitted rate tends to $R$ and whose average sum-product bit error tends to zero. For $r=g=2$ and each $\ell\in\{3,4,5\}$, an interval of binary symmetric channels has capacity greater than $R$ but retains positive transmitted-bit error under terminated density evolution as chain length grows relative to coupling width. Both results follow from the signs of the same density-valued potential at uncoupled fixed points. The degree-three proof combines analytic bounds for $\ell\geq33$ with exact interval certificates for $4\leq\ell\leq32$, followed by threshold saturation and a projection argument for the actual rate. The degree-two proof analytically constructs a fixed point with negative potential and controls both boundary contributions. We relate the potential and the degree-two bifurcation condition to earlier statistical-mechanical predictions. The finite certificates and verification software are available in a versioned supplement.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.15526 — 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-16T01:21:38.627Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).