On the Girth of Quasi-Cyclic Protograph LDPC Codes

DOI10.1109/TIT.2013.2251395zbMATH Open1364.94611MaRDI QIDQ5346473FDOQ5346473

Authors: Mehdi Karimi, Amir H. Banihashemi 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory (05C90) Paths and cycles (05C38) Linear codes (general theory) (94B05) Applications of graph theory to circuits and networks (94C15)

Cited In (13)

• An explicit method to generate some QC LDPC codes with girth 8
• Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis
• Title not available (Why is that?)
• A reduction in the search space of QC-LDPC codes with girth 8
• 4-cycle free APM-LDPC codes with an explicit construction
• Number of cycles of small length in a graph
• Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
• Recursive construction of \((J,L)\) QC LDPC codes with girth 6
• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
• Counting short cycles of \((c,d)\)-regular bipartite graphs
• Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
• On the search of smallest QC-LDPC code with girth six and eight

This page was built for publication: On the Girth of Quasi-Cyclic Protograph LDPC Codes

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