Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
From MaRDI portal
Publication:2285772
Recommendations
- On the search of smallest QC-LDPC code with girth six and eight
- \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
- Recursive construction of \((J,L)\) QC LDPC codes with girth 6
- A reduction in the search space of QC-LDPC codes with girth 8
- An explicit method to generate some QC LDPC codes with girth 8
Cites work
- An explicit method to generate some QC LDPC codes with girth 8
- Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
- Codes with girth 8 Tanner graph representation
- Constructions of QC LDPC codes based on integer sequences
- Efficient Search of Girth-Optimal QC-LDPC Codes
- LDPC codes from triangle-free line sets
- On the Girth of Quasi-Cyclic Protograph LDPC Codes
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Some low-density parity-check codes derived from finite geometries
Cited in
(7)- An explicit method to generate some QC LDPC codes with girth 8
- An algebraic construction of QC-LDPC codes based on powers of primitive elements in a finite field and free of small ETSs
- A reduction in the search space of QC-LDPC codes with girth 8
- Recursive construction of \((J,L)\) QC LDPC codes with girth 6
- \((7,K)\) girth-8 QC-LDPC codes with an explicit construction
- LDPC codes constructed from cubic symmetric graphs
- On the search of smallest QC-LDPC code with girth six and eight
This page was built for publication: Construction of girth-8 \textit{(3,L)}-QC-LDPC codes of smallest CPM size using column multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285772)
