A technique for the identification of trapping sets in LDPC codes

Abstract

In this paper we consider the problem of identifying trapping sets in Low Density Parity Check codes (LDPC), which is a hard NP-complete problem, as conjectured in [1]. We introduce a method for identifying trapping sets in LDPC codes. The proposed method is flexible and parametric. Furthermore it achieves low complexity and execution time and low memory requirements.