Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/VTCSpring.2019.8746644 | 2019 IEEE 89th Vehicular Technology Conference (VTC2019-Spring) |
Keywords | Field | DocType |
finite field based CN-GC-LDPC code,BIBD based CN-GC-LDPC code,RC-constraint,parity-check matrix | Finite field,Low-density parity-check code,Computer science,Matrix (mathematics),Algorithm,Electronic engineering | Conference |
ISSN | ISBN | Citations |
1090-3038 | 978-1-7281-1218-3 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |