Threshold Saturation from a Bounded Region in Multidimensional Spatially Coupled Codes over the BEC

2026-09-21

AI Summary

研究证明了通过在多维空间耦合码中使用有限区域缩短方法，可以改善LDPC和MacKay-Neal码在二元擦除信道上的解码性能。

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 $\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.

Problem

• spatially coupled codes
• binary erasure channel
• shortened region
• decoding threshold
• capacity achieving

Innovation

• spatially coupled codes
• binary erasure channel
• threshold saturation
• shortening fraction
• capacity achieving