Lifting methods for quasi-cyclic LDPC codes

Abstract

In this paper, we present two simple methods to construct a quasi-cyclic LDPC (QC-LDPC) code of larger length by lifting a given QC-LDPC code. We show that its girth is always larger than or equal to that of the given QC-LDPC code. Applying the methods recursively, it is possible to construct a sequence of QC-LDPC codes generated from a single exponent… (More)
DOI: 10.1109/LCOMM.2006.1638625

1 Figure or Table

Topics

Statistics

051015'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

51 Citations

Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics