| A Construction of Low-Density Parity-Check Codes |
| Received:November 06, 2011 Revised:May 22, 2012 |
| Key Words:
low-density parity-check code iterative decoding group divisible design.
|
| Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.11071056; 11201114). |
|
| Hits: 3772 |
| Download times: 3964 |
| Abstract: |
| Low-density parity-check ($LDPC$) codes were first presented by Gallager in 1962. They are linear block codes and their bit error rate (BER) performance approaches remarkably close to the Shannon limit. The $LDPC$ codes created much interest after the rediscovery by Mackay and Neal in 1995. This paper introduces some new LDPC codes by considering some combinatorial structures. We present regular $LDPC$ codes based on group divisible designs which have Tanner graphs free of four-cycles. |
| Citation: |
| DOI:10.3770/j.issn:2095-2651.2013.03.007 |
| View Full Text View/Add Comment |
