Leafless elementary trapping sets (LETSs) are known to be the problematic structures in the error floor region of low-density parity-check (LDPC) codes over the additive white Gaussian (AWGN) channel under iterative decoding algorithms. While problems involving the general category of trapping sets, and the subcategory of elementary trapping sets (ETSs), have been shown to be NP-hard, similar results for LETSs, which are a subset of ETSs are not available. In this paper, we prove that for a general LDPC code, finding a LETS of a given size a with minimum number of odd-degree check nodes b is NP-hard to approximate within any approximation factor. We also prove that finding the minimum size a of a LETS with a given b is NP-hard to approximate within any approximation factor. Similar results are proved for elementary absorbing sets, a popular subcategory of LETSs.

Additional Metadata
Keywords absorbing sets (ABS), computational complexity, elementary absorbing sets (EABS), elementary trapping sets (ETS), leafless elementary trapping sets (LETS), Low-density parity-check (LDPC) codes, NP-hardness, trapping sets (TS)
Persistent URL dx.doi.org/10.1109/TIT.2019.2904988
Journal IEEE Transactions on Information Theory
Citation
Dehghan, A. (Ali), & Banihashemi, A. (2019). Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes. In IEEE Transactions on Information Theory (Vol. 65, pp. 4307–4315). doi:10.1109/TIT.2019.2904988