On the Hardness of Approximating Stopping and Trapping Sets
Publication Date
2010
Journal or Book Title
IEEE TRANSACTIONS ON INFORMATION THEORY
Abstract
We prove that approximating the size of the smallest trapping set in Tanner graphs of linear block codes, and more restrictively, LDPC codes, is NP-hard. The proof techniques rely on reductions from three NP-hard problems, the set cover, minimum three-dimensional matching, and the minimum Hamming distance problem. The ramifications of our findings are that methods used for estimating the height of the error-floor of long LDPC codes, centered around trapping set enumeration, cannot provide accurate worst-case performance predictions.
DOI
https://doi.org/10.1109/ITW.2007.4313082
Pages
1640-1650
Volume
56
Issue
4
Recommended Citation
Mcgregor, A and Milenkovic, O, "On the Hardness of Approximating Stopping and Trapping Sets" (2010). IEEE TRANSACTIONS ON INFORMATION THEORY. 911.
https://doi.org/10.1109/ITW.2007.4313082