Decoding via the Peeling decoder

This demo is a visualization of the peeling decoder for transmission over the Binary Erasure Channel (BEC). At each iteration, the peeling decoder performs the following operations.

• Removes all the degree one check nodes.
• Removes the neighboring variable nodes to these degree one check nodes as

these variable nodes are now known.

• Updates the graph.

There are two options: one corresponding to the decoding success and the other one corresponds to the decoding failure.

• successful: The peeling decoder recovers the correct value of all the variable nodes.
• not successful: There is decoding failure and the peeling decoder gets

stuck in the largest stopping set contained in the channel erasures.

Stopping set: In a given graph, a subset S of the set of variable nodes is a stopping set if all the check nodes connected to S are connected to it at least twice.

• M. Luby, M.Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "Analysis of low density codes and improved designs using irregular graphs," in Proc. of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 249–258.
• M. Luby, M.Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, 47 (2001), pp. 569–584.