In this paper, we define a structure to obtain exponent matrices of girth-8 QC-LDPC codes with column weight 3. Using the difference matrices introduced by Amirzade et al., we investigate necessary and sufficient conditions which result in a Tanner graph with girth 8. Our proposed method contributes to reduce the search space in recognizing the elements of an exponent matrix. In fact, in this method we only search to obtain one row of an exponent matrix. The other rows are multiplications of that row.
Amirzade, F., Alishahi, M., & Rafsanjani-Sadeghi, M. (2020). A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8. Journal of Algebraic Systems, 7(2), 271-280. doi: 10.22044/jas.2019.8086.1397
MLA
F. Amirzade; M. Alishahi; M.R. Rafsanjani-Sadeghi. "A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8". Journal of Algebraic Systems, 7, 2, 2020, 271-280. doi: 10.22044/jas.2019.8086.1397
HARVARD
Amirzade, F., Alishahi, M., Rafsanjani-Sadeghi, M. (2020). 'A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8', Journal of Algebraic Systems, 7(2), pp. 271-280. doi: 10.22044/jas.2019.8086.1397
VANCOUVER
Amirzade, F., Alishahi, M., Rafsanjani-Sadeghi, M. A REDUCTION IN THE SEARCH SPACE OF QC-LDPC CODES WITH GIRTH 8. Journal of Algebraic Systems, 2020; 7(2): 271-280. doi: 10.22044/jas.2019.8086.1397
)