On the girth of Tanner (3, 7) quasi-cyclic LDPC codes

zbMATH Open1316.94125MaRDI QIDQ5407404FDOQ5407404

Authors: Mohammad Gholami, Fahime Sadat Mostafaiee 

Publication date: 7 April 2014

Recommendations

• scientific article; zbMATH DE number 6874357
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes
• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices

zbMATH Keywords

girthTanner graphLow-density parity-check (LDPC) codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of graph theory to circuits and networks (94C15) Other types of codes (94B60)

Cited In (5)

• Restriction conditions on \(\mathrm{PL}(7, 2)\) codes \((3 \le \vert\mathcal{G}_i\vert \le 7)\)
• Title not available (Why is that?)
• On the girth of tanner (3, 5) quasi-cyclic LDPC codes
• Some results on the structure of constacyclic codes and new linear codes over \(\mathrm{GF}(7)\) from quasi-twisted codes
• On the girth of Tanner \((3,11)\) quasi-cyclic LDPC codes

This page was built for publication: On the girth of Tanner \((3, 7)\) quasi-cyclic LDPC codes

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