Publication details
Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum
| Authors | |
|---|---|
| Year of publication | 2021 |
| Type | Article in Proceedings |
| Conference | 2021 IEEE 32ND ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC) |
| Citation | |
| Doi | http://dx.doi.org/10.1109/PIMRC50174.2021.9569696 |
| Keywords | low-density parity-check codes; graph spectrum; expander codes |
| Description | Research on the expander code shows that for a regular low-density parity-check (LDPC) code, the Tanner graph's spectrum determines its properties, such as the minimum distance and the size of stopping sets. In this study, we demonstrate theoretically and experimentally that the performance of irregular LDPC codes is related to the graph spectrum. Our observations may provide an efficient metric to search for good irregular LDPC codes. |