Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC
Abstract
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 ℓ>r≥2, g≥2: their actual transmitted rates tend to r/ℓ and their average bit-erasure probabilities under sum-product decoding vanish below 1−r/ℓ. 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.
Related
- A Link-Based Algorithm for Stochastic User Equilibrium with Bounded Choice and Local Detour Threshold
- Spatially Coupled MacKay-Neal Codes on Symmetric Markov Noise: A Reduction to BMS Channels
- Decay Rates and Domain Dependence of a Coupled Wave-Heat System with Spatially Dependent Heat Coefficients
- Spatially Coupled MacKay-Neal Codes Achieve Capacity on BMS Channels at Fixed Degrees
- Spatially Coupled MacKay-Neal/Hsu-Anastasopoulos CSS Codes Achieve the Quantum-Erasure Hashing Bound by Seeded BP Decoding
BibTeX
@misc{kasai2026threshold,
title = {{Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC}},
author = {Kenta Kasai},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.24568},
eprint = {2609.24568},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.24568},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC
AU - Kenta Kasai
PY - 2026
DA - 2026/09/21
PB - arXiv
DO - 10.48550/arxiv.2609.24568
UR - https://arxiv.org/abs/2609.24568
AB - 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 ℓ>r≥2, g≥2: their actual transmitted rates tend to r/ℓ and their average bit-erasure probabilities under sum-product decoding vanish below 1−r/ℓ. 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.
ER -