(7,K) GIRTH-8 QC-LDPC CODES WITH AN EXPLICIT CONSTRUCTION
From MaRDI portal
Publication:5064394
DOI10.22044/jas.2021.8911.1434OpenAlexW3203146516MaRDI QIDQ5064394
Ghaffar Raeisi, Mohammad Gholami, Marjan Majdzadeh
Publication date: 15 March 2022
Full work available at URL: http://jas.shahroodut.ac.ir/article_2195_c0df1d88cfdf2c920bfa4dcd2111e302.pdf
Cites Work
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
- A recursive approach to low complexity codes
- 4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION
- Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
- Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
- On the Girth of Quasi-Cyclic Protograph LDPC Codes
- Unnamed Item