Show that the belief propagation algorithm for the BEC described in Section 8.5 has a decoding complexity that is not larger than O(N2 ). Show that the breakout value pbr for the BEC for a regular (N,...

Show that the belief propagation algorithm for the BEC described in Section 8.5 has a decoding complexity that is not larger than O(N2 ).

Show that the breakout value pbr for the BEC for a regular (N, J, K) LDPC block code with J = 2 equals 1/(K − 1).