Recursive construction of $(J,L)$ QC LDPC codes with girth 6

DOI10.22108/toc.2016.8430zbMath1463.11119OpenAlexW2767034520MaRDI QIDQ5134443

Mohammad Gholami, Zahra Rahimi

Publication date: 16 November 2020

Full work available at URL: http://toc.ui.ac.ir/article_8430_4d65fe9a28acc359f137574e8342c0f4.pdf

zbMATH Keywords

Tanner graphexponent matrixQC LDPC codes

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Relations with coding theory (11H71)

Cites Work

• Unnamed Item
• Construction of Low-Density Parity-Check Codes Based on Balanced Incomplete Block Designs
• Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach
• A recursive approach to low complexity codes
• On the Girth of Quasi-Cyclic Protograph LDPC Codes