On the class of array-based APM-LDPC codes
From MaRDI portal
Publication:4956589
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
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- A recursive approach to low complexity codes
- Design of capacity-approaching irregular low-density parity-check codes
- 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
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)