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

DOI10.1134/S0032946020020039zbMATH Open1459.94167OpenAlexW4229860445MaRDI QIDQ784385FDOQ784385

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

Publication date: 3 August 2020

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

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

zbMATH Keywords

LDPC codeTanner graphbase equationexpanded graphextrinsic message degreeprotographunion of cycles

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

• Factor graphs and the sum-product algorithm
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Regular and irregular progressive edge-growth tanner graphs
• Design of capacity-approaching irregular low-density parity-check codes
• On the Girth of Quasi-Cyclic Protograph LDPC Codes

Cited In (1)

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

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

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