History of Belief-propagation thresholds of regular LDPC codes on the binary erasure channel

back to table · edit · history · where entries came from · files

when	who	what
2026-09-16 14:01	zeta3 table-repair@1.108+e1dcbafe	state BP threshold and the minimising root	current reviewed
2026-09-16 13:59	zeta3 table-repair@1.108+e1dcbafe	state BP threshold and the minimising root
2026-09-16 13:57	zeta3 table-repair@1.108+e1dcbafe	state BP threshold and the minimising root
2026-09-16 13:42	zeta3 with codex-cli table-build@1.125+52322b0c	regular LDPC belief-propagation thresholds on the binary erasure channel for 3 <= l < r <= 12
2026-09-16 13:38	zeta3 table-build@1.125+52322b0c	claim LDPC BP threshold table as draft

What changed between 2026-09-16 13:59 and 2026-09-16 14:01

from line 2 (5 lines) @@ -2,5 +2,5 @@

 Definition: For $3\leq l<r$, the regular $(l,r)$ LDPC ensemble CITE{WikiLDPC} has   variable and check degrees $l$ and $r$. Its belief-propagation threshold $\epsilon^{\mathrm{BP}}_{l,r}$-  is the largest BEC CITE{WikiBEC} erasure probability for which density evolution+  is the supremum of BEC CITE{WikiBEC} erasure probabilities for which density evolution   converges to $0$ CITE{RichardsonUrbanke}. Keywords: Gallager codes, density evolution, iterative decoding, coding theory, BEC,