4-cycle free APM-LDPC codes with an explicit construction

DOI10.22044/JAS.2020.9086.1441MaRDI QIDQ4956587zbMATHOpenAlexFDO

Authors Zahra Gholami, Mohammad Gholami

Publication date 2 September 2021

Full work available at URL http://jas.shahroodut.ac.ir/article_1957_2e7bbb3d01640a654c06d6c41e61cedd.pdf

zbMATH Keywords

girthexplicit constructionsAPM-LDPC codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Computer solution of Diophantine equations (11Y50)

Recommendations

• On the class of array-based APM-LDPC codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• Recursive construction of LDPC codes
• High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction

Cites work

• scientific article; zbMATH DE number 2154511 (Why is no real title available?)
• Good error-correcting codes based on very sparse matrices
• On the Girth of Quasi-Cyclic Protograph LDPC Codes
• Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs
• Regular and irregular progressive edge-growth tanner graphs
• Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth

Cited in

(2)

• \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
• On the class of array-based APM-LDPC codes

This page was built for publication: 4-cycle free APM-LDPC codes with an explicit construction

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