Lazebnik-Ustimenko (LU) code[1,2] 

Description

LDPC code whose Tanner graph comes from a particular family of \(q\)-regular graphs [1] of known girth and relatively large stopping sets.

Parents

References

[1]
F. Lazebnik and V. A. Ustimenko, “Explicit construction of graphs with an arbitrary large girth and of large size”, Discrete Applied Mathematics 60, 275 (1995) DOI
[2]
J.-L. Kim et al., “Explicit Construction of Families of LDPC Codes With No<tex>\(4\)</tex>-Cycles”, IEEE Transactions on Information Theory 50, 2378 (2004) DOI
Page edit log

Your contribution is welcome!

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

edit on this site

Zoo Code ID: lu_ldpc

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

Cite as:

“Lazebnik-Ustimenko (LU) code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2023. https://errorcorrectionzoo.org/c/lu_ldpc

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