Construction of Replacement Set in the GC-LDPC Codes Based on BIBDs

In the GC-LDPC code, the replacement set plays an important role in the construction of the parity-check matrix H. Considering BIBDs with λ = 1, a replacement set can be structured which satisfies RC-constraint. The parity-check matrix H of the GC-LDPC code can be straightforwardly constructed from the replacement set. Simulation results show that the performance of BIBDs based CN-GC-LDPC code surpasses finite field based CN-GC-LDPC code.