A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8
From MaRDI portal
Publication:4956452
DOI10.22044/jas.2019.8086.1397zbMath1495.94099OpenAlexW2981318223MaRDI QIDQ4956452
Meysam Alishahi, M. R. Rafsanjani-Sadeghi, Farzane Amirzade
Publication date: 2 September 2021
Full work available at URL: http://jas.shahroodut.ac.ir/article_1595_a7ac6815ccabe0982d7a0162bf5de1b0.pdf
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Direct numerical methods for linear systems and matrix inversion (65F05)
Uses Software
Cites Work
- Unnamed Item
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices
- Algebraic construction of sparse matrices with large girth
- Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than $12$
- A recursive approach to low complexity codes
- Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth
- On the Girth of Quasi-Cyclic Protograph LDPC Codes