The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes

Table 1

The number of nodes and valid configurations on the computation tree of a (3,6)-regular LDPC code.

Iterations	Variable Nodes	Check Nodes	Configurations
1	16	3	8192
2	166	33	≈10^40
3	1666	333	≈10^401