ON THE CLASS OF ARRAY-BASED APM-LDPC CODES | ||
| Journal of Algebraic Systems | ||
| دوره 8، شماره 2، فروردین 2021، صفحه 291-301 اصل مقاله (160.6 K) | ||
| نوع مقاله: Original Manuscript | ||
| شناسه دیجیتال (DOI): 10.22044/jas.2020.8875.1431 | ||
| نویسندگان | ||
| A. Nassaj* 1؛ A. R. Naghipour2 | ||
| 1Mathematics, Sharekord University, Sharekord, Iran | ||
| 2Faculty of Methematical Sciences Shahrekord University, Shahrekord, Iran | ||
| چکیده | ||
| We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and flexible row (column)-weights. Simulation results justify well performance, minimum-distances and cycle distribution of these codes in comparison the array-LDPC , structured QC-LDPC and APM-LDPC. | ||
| کلیدواژهها | ||
| APM-LDPC code؛ Array-LDPC code؛ Tanner graph | ||
|
آمار تعداد مشاهده مقاله: 390 تعداد دریافت فایل اصل مقاله: 521 |
||