[Jump to code hierarchy]

Regular LDPC code

Description

An LDPC code whose parity-check matrix has a fixed number of entries for each row or column.

Primary Hierarchy

Parents
Regular LDPC codes are regular binary Tanner codes defined on sparse graphs whose constraint nodes represent parity-check codes.
Regular LDPC code
Children
Cycle LDPC codes form a class of regular QC LDPC codes [1].
Expander codes yield an explicit (i.e., non-random) asymptotically good LDPC code family [2].
GL codes are the first LDPC codes.
MN-LDPC codes re-invigorated the study of LDPC codes about 30 years after their discovery.

References

[1]
R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, “LDPC Block and Convolutional Codes Based on Circulant Matrices”, IEEE Transactions on Information Theory 50, 2966 (2004) DOI
[2]
M. Sipser and D. A. Spielman, “Expander codes”, IEEE Transactions on Information Theory 42, 1710 (1996) DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: regular_ldpc

Cite as:
“Regular LDPC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/regular_ldpc
BibTeX:
@incollection{eczoo_regular_ldpc, title={Regular LDPC code}, booktitle={The Error Correction Zoo}, year={2023}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/regular_ldpc} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/regular_ldpc

Cite as:

“Regular LDPC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/regular_ldpc

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/bits/tanner/regular_tanner/regular_ldpc/regular_ldpc.yml.