Trapping set structure of LDPC codes on finite geometries

Qiuju Diao, Ying Yu Tai, Shu Lin, K. Abdel-Ghaffar
2013 2013 Information Theory and Applications Workshop (ITA)  
The trapping set structure of LDPC codes constructed based on finite geometries, called finite geometry (FG) LDPC codes, is analyzed using a geometric approach. In this approach, trapping sets in the Tanner graph of an FG-LDPC code are represented by subgeometries of the geometry based on which the code is constructed. Using this geometrical representation, bounds and configurations of trapping sets of an FG-LDPC code can be derived and analyzed.
doi:10.1109/ita.2013.6502951 dblp:conf/ita/DiaoTLA13a fatcat:nfcecz65kvcw3h6xd6zt33saca