|
|
|
|
recursive construction of (j,l) qc ldpc codes with girth 6
|
|
|
|
|
|
|
|
نویسنده
|
gholami mohammad ,gholami mohammad ,rahimi zahra
|
|
منبع
|
transactions on combinatorics - 2016 - دوره : 5 - شماره : 2 - صفحه:11 -22
|
|
چکیده
|
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 lowerbound than the ones proposed recently with girth 6.
|
|
کلیدواژه
|
qc ldpc codes ,tanner graph ,exponent matrix.
|
|
آدرس
|
shahrekord university, department of mathematics, ایران. institute for research in fundamental sciences (ipm), school of mathematics, ایران, shahrekord university, department of mathematics, ایران. institute for research in fundamental sciences (ipm), school of mathematics, ایران, university of shahrekord, department of mathematics, ایران
|
|
پست الکترونیکی
|
zrahimi.1368@yahoo.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|