Double-Hamming based QC LDPC codes with large minimum distance
(2011) IEEE International Symposium on Information Theory, 2011- 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... (More)
- 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1971218
- author
- Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU and Kudryashov, Boris LU
- organization
- publishing date
- 2011
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- [Host publication title missing]
- conference name
- IEEE International Symposium on Information Theory, 2011
- conference location
- Saint Petersburg, Russian Federation
- conference dates
- 2011-07-31 - 2011-08-05
- external identifiers
-
- scopus:80054817008
- DOI
- 10.1109/ISIT.2011.6034273
- language
- English
- LU publication?
- yes
- id
- 0a7c711f-eb48-44e5-8adc-8b7116082851 (old id 1971218)
- date added to LUP
- 2016-04-04 14:38:17
- date last changed
- 2022-01-30 02:22:33
@inproceedings{0a7c711f-eb48-44e5-8adc-8b7116082851, 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.}}, author = {{Bocharova, Irina and Hug, Florian and Johannesson, Rolf and Kudryashov, Boris}}, booktitle = {{[Host publication title missing]}}, language = {{eng}}, title = {{Double-Hamming based QC LDPC codes with large minimum distance}}, url = {{https://lup.lub.lu.se/search/files/6406423/1971223.pdf}}, doi = {{10.1109/ISIT.2011.6034273}}, year = {{2011}}, }