Double-Hamming based QC LDPC codes with large minimum distance

Summary, in English

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.

• Author: Irina Bocharova; Florian Hug; Rolf Johannesson; Boris Kudryashov
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2011
• Language: English
• Publication/Series: [Host publication title missing]
• Full text: - 237 kB; Download statistics
• Links: http://dx.doi.org/10.1109/ISIT.2011.6034273
• Document type: Conference paper
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory, 2011
• Conference date: 2011-07-31 - 2011-08-05
• Conference place: Saint Petersburg, Russian Federation
• Status: Published
• Research group: Information Theory