Posted by: atri | November 14, 2007

## Lecture 34: Iterative Message Passing Algorithm for BEC

In today’s lecture we saw the full description of an iterative message passing algorithm for $BEC_{\alpha}$. We then proved the crucial claim that the random variables corresponding to messages received by a node in the factor graph (in any round of the decoding algorithm) are independent.

Next lecture, we will continue with the analysis of the algorithm.