Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes

A two-phase iterative decoding algorithm for low-density (LD) codes suggested by the authors of the paper is analyzed for transmission over a binary symmetric channel (BSC). A lower bound on the maximal error probability $p$ of the BSC for which the decoding error probability of iterative decoding goes to zero as the code length goes to infinity is derived.