Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis

DOI10.1134/S0032946020040031zbMath1478.94126OpenAlexW3043427086MaRDI QIDQ2229575

A. A. Ovinnikov, K. N. Zavertkin, A. V. Kharin

Publication date: 18 February 2021

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946020040031

zbMATH Keywords

LDPC codeTanner graphbase equationexpanded graphextrinsic message degreeprotographunion of cycles

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Expander graphs (05C48)

Cites Work

• Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Regular and irregular progressive edge-growth tanner graphs
• On the Girth of Quasi-Cyclic Protograph LDPC Codes

This page was built for publication: Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis