Iterative decoding algorithms for low-density parity-check (LDPC) codes are known to be subject to decoding failures that result in high error floors in the bit error rate performance curves. Recently, researchers became aware that the error floor was a result of a number of properties of the code's graph representation, including cycles, stopping sets, trapping sets, absorbing sets, and pseudo-co ...