2 problems

Let a random parity-check code have length $n$, $m=n(1-R)$ parity checks, and arbitrary degree distributions. The adaptive LP decoding algorithm is the iterative algorithm that add…

Adaptive LP decoding conjecture. As $n$ increases, the algorithm converges with probability arbitrarily close to $1$ in at most $b1$ iterations and with at most $b2$ final parity-c…