On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes

Andrew McGregor, Olgica Milenkovic

We prove that approximating the size of stopping and trapping sets in Tanner graphs of linear block codes, and more restrictively, the class of low-density parity-check (LDPC) code…