A general class of LDPC finite geometry codes and their performance
Jun Jim Xu, Heng Tang, Yu Kou, Shu Lin, Khaled Abdel-Ghaffar · 2003
We present a general class of finite geometry LDPC codes which perform well with iterative decoding although their Tanner graphs may contain many cycles of length 4. A hybrid two-stage decoding algorithm is proposed that combines iterative and multi-step majority-logic decodings to achieve good performance with low decoding complexity.