In this paper, we propose a characterization for nonelementary trapping sets (NETSs) of low-density parity-check (LDPC) codes. The characterization is based on viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The characterization corresponds to an efficient search algorithm that under certain conditions is exhaustive. As an application of the proposed characterization/search, we obtain lower and upper bounds on the stopping distance s- min of LDPC codes. We examine a large number of regular and irregular LDPC codes, and demonstrate the efficiency and versatility of our technique in finding lower and upper bounds on, and in many cases the exact value of, s- min. Finding s- min, or establishing search-based lower or upper bounds, for many of the examined codes are out of the reach of any existing algorithm.

Additional Metadata
Persistent URL dx.doi.org/10.1109/ISIT.2018.8437769
Conference 2018 IEEE International Symposium on Information Theory, ISIT 2018
Citation
Hashemi, Y. (Yoones), & Banihashemi, A. (2018). Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets. In IEEE International Symposium on Information Theory - Proceedings (pp. 1635–1639). doi:10.1109/ISIT.2018.8437769