Structured quasi-cyclic LDPC codes with girth 18 and column-weight

Esmaeili, Morteza; Gholami, Mohammad

doi:10.1016/j.aeue.2008.11.013

Cited by 38 publications

(57 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Amongst others, new QC regular LDPC block codes with girth between 14 and 24 have been presented. In particular, these codes improve previous the published results in [7].…”

Section: Resultssupporting

confidence: 78%

“…The obtained results for QC (J = 3, K)-regular LDPC block codes with girth g = 20, 22, and 24 are presented in Table III, based on (J = 3, K)-regular LDPC block codes constructed from all-ones matrices with girth g = 8 [7], [17]. As before, the first column K denotes the number of nonzero elements in each row; then we give the obtained girth g and the dimensions of the (n, k) block code after tailbiting to length M .…”

Section: B Base Matrices Constructed From (J K)-regular Ldpc Blockmentioning

confidence: 99%

“…If applicable, previous results from [7] are given for comparison. In the first column K we give the number of nonzero elements in each row.…”

Section: A Base Matrices Constructed From Steiner Triple Systemsmentioning

confidence: 99%

“…Algorithm B requires the same number of N T summations for computing the path (13) (371100, 148440) [7] voltages, roughly N T log 2 N T operations for sorting the set, and N T comparisons, leading to a total complexity estimate of N T log 2 N T .…”

Section: Complexity Comparisonmentioning

confidence: 99%

“…For example, codes with girth 14 are constructed in [6] while codes with girth up to 18 are presented in [7]. Most papers combine some algebraic techniques and computer search.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Some voltage graph-based LDPC tailbiting codes with large girth

Bocharova

Hug

Johannesson

et al. 2011

2011 IEEE International Symposium on Information Theory Proceedings

View full text Add to dashboard Cite

Abstract-The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.

show abstract

“…Amongst others, new QC regular LDPC block codes with girth between 14 and 24 have been presented. In particular, these codes improve previous the published results in [7].…”

Section: Resultssupporting

confidence: 78%

Section: B Base Matrices Constructed From (J K)-regular Ldpc Blockmentioning

confidence: 99%

“…If applicable, previous results from [7] are given for comparison. In the first column K we give the number of nonzero elements in each row.…”

Section: A Base Matrices Constructed From Steiner Triple Systemsmentioning

confidence: 99%

Section: Complexity Comparisonmentioning

confidence: 99%

“…For example, codes with girth 14 are constructed in [6] while codes with girth up to 18 are presented in [7]. Most papers combine some algebraic techniques and computer search.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations