On the class of array-based APM-LDPC codes

DOI10.22044/JAS.2020.8875.1431zbMATH Open1469.94138OpenAlexW3147424469MaRDI QIDQ4956589FDOQ4956589

Authors: A. Nassaj, A. R. Naghipour 

Publication date: 2 September 2021

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

Recommendations

• 4-cycle free APM-LDPC codes with an explicit construction
• High-Rate Quasi-Cyclic Low-Density Parity-Check Codes Derived From Finite Affine Planes
• On the minimum distance of array codes as LDPC codes
• Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
• LDPC codes from Singer cycles

zbMATH Keywords

Tanner graphAPM-LDPC codearray-LDPC code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Convolutional codes (94B10)

Cites Work

• Title not available (Why is that?)
• Factor graphs and the sum-product algorithm
• A recursive approach to low complexity codes
• 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

Cited In (1)

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

Uses Software

• LDPC

This page was built for publication: On the class of array-based APM-LDPC codes

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