Abstract
A new method using Hamming codes to construct base matrices of (J, K)-regular LDPC convolutional codes with large free distance is presented. By proper labeling the corresponding base matrices and tailbiting these parent convolutional codes to given lengths, a large set of quasi-cyclic (QC) (J, K)-regular LDPC block codes with large minimum distance is obtained. The corresponding Tanner graphs have girth up to 14. This new construction is compared with two previously known constructions of QC (J, K)-regular LDPC block codes with large minimum distance exceeding (J+1)!. Applying all three constructions, new QC (J, K)-regular block LDPC codes with J=3 or 4, shorter codeword lengths and/or better distance properties than those of previously known codes are presented.
| Original language | English |
|---|---|
| Title of host publication | [Host publication title missing] |
| DOIs | |
| Publication status | Published - 2011 |
| Event | IEEE International Symposium on Information Theory, 2011 - Saint Petersburg, Russian Federation Duration: 2011 Jul 31 → 2011 Aug 5 |
Conference
| Conference | IEEE International Symposium on Information Theory, 2011 |
|---|---|
| Abbreviated title | ISIT07 |
| Country/Territory | Russian Federation |
| City | Saint Petersburg |
| Period | 2011/07/31 → 2011/08/05 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering