Near regular LDPC codes based on combinatorial designs
Shyam Saurabh, Sheet Nihal Topno, Kishore Sinha · Discrete Mathematics Algorithms and Applications · 2024
Some new approaches for constructing near regular binary low-density parity-check (LDPC) codes free of 4-cycles are proposed using dual of certain combinatorial designs which are [Formula: see text]-configurations. The present constructions further broaden the class of code lengths. The present constructions give higher code rates of near regular LDPC codes compared to the earlier codes with respect to same code length.