A density-based progressive edge-growth matrix creation technique for LDPC codes

In this work, we propose a method specially suited for creating high rate LDPC codes. The technique employed adds the connections of the bipartite graph on an edge-by-edge basis. Unlike other progressive edge-growth methods however, we favor the use of a density metric over the conventional distance metric for the node selection process. As benchmark, the algorithm yield codes of higher rates than those obtained from bit-filling algorithms. Because of its efficient approach in filling edges on the bipartite graph however, the algorithm may also be used to produce codes (of various rates) that are very competitive in terms of error-correcting performance.