In BEC, we know for certain that the bits are either correct or erasure thus when we compute the log likelihood ratio (LLR) in belief propagation can only be inf, -inf and 0.
How can we implement the BP for a channel that is binary erasure?
I also tried to do the Galleger's algorithm. Here i do the bits-fliping to 1 or -1 whenever the incoming message of the check node is erased, 0.
Does it mean that the algorithm can only correct 50% of the error bit? Is this the way to implement the Galleger's algorithm for BEC?