Recursive construction of LDPC codes

MaRDI QIDQ3500762zbMATH OpenFDO

Authors Binbin Liu, Dong Bai, Shunliang Mei

Publication date 3 June 2008

zbMATH Keywords

circulant permutation matricescycleslow-density parity-check codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)

Recommendations

• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• scientific article; zbMATH DE number 1714649
• Recursive construction of \((J,L)\) QC LDPC codes with girth 6
• Construction of Irregular LDPC Codes by Quasi-Cyclic Extension
• Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking

Cited in

(5)

• Study on the distribution law of random code structure of irregular ldpc codes and its application in eliminating short cycles
• Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking
• Recipes for adjoint code construction
• 4-cycle free APM-LDPC codes with an explicit construction
• Construction of LCD-MRD codes of length n > N

This page was built for publication: Recursive construction of LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3500762)