%0 Journal Article
%T Recursive construction of $(J,L)$ QC LDPC codes with girth 6
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Gholami, Mohammad
%A Rahimi, Zahra
%D 2016
%\ 06/01/2016
%V 5
%N 2
%P 11-22
%! Recursive construction of $(J,L)$ QC LDPC codes with girth 6
%K QC LDPC codes
%K Tanner graph
%K exponent matrix
%R 10.22108/toc.2016.8430
%X In this paper, a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6. For a $J times L$ exponent matrix $E$, the lower bound $Q(E)$ is obtained explicitly such that $(J,L)$ QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM) size $m geq Q(E)$. The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6.
%U https://toc.ui.ac.ir/article_8430_4d65fe9a28acc359f137574e8342c0f4.pdf