Advanced

Double-Hamming based QC LDPC codes with large minimum distance

Bocharova, Irina LU ; Hug, Florian LU ; Johannesson, Rolf LU and Kudryashov, Boris LU (2011) IEEE International Symposium on Information Theory, 2011 In [Host publication title missing]
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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
[Host publication title missing]
conference name
IEEE International Symposium on Information Theory, 2011
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
2011-05-30 13:34:59
date last changed
2017-01-01 08:19:43
@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          = {http://dx.doi.org/10.1109/ISIT.2011.6034273},
  year         = {2011},
}