Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
Jun Xu, Lei Chen, Ivana Djurdjevic, Shu Lin, Khaled Abdel-Ghaffar · IEEE Transactions on Information Theory · 2007
Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs