On the Girth of Quasi-Cyclic Protograph LDPC Codes

DOI10.1109/TIT.2013.2251395zbMath1364.94611MaRDI QIDQ5346473

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) Linear codes (general theory) (94B05) Paths and cycles (05C38) Applications of graph theory to circuits and networks (94C15)

Related Items (12)

A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8 ⋮ An explicit method to generate some QC LDPC codes with girth 8 ⋮ Number of cycles of small length in a graph ⋮ On the search of smallest QC-LDPC code with girth six and eight ⋮ (7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION ⋮ Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis ⋮ Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers ⋮ 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 ⋮ Counting short cycles of (c,d)-regular bipartite graphs ⋮ 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION

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