Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis
Aleksei Kharin, Konstantin Zavertkin, Aleksei Ovinnikov · Problems of Information Transmission · 2020
We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to 10 inclusive. Based on previous papers, we have extended a set of theorems specifying transformation rules for cycles and paths when passing from a protograph to the Tanner graph. We propose a procedure for detecting the existence of a cycle of length 10 in the expanded graph by analyzing the protograph.