4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION | ||
| Journal of Algebraic Systems | ||
| دوره 8، شماره 2، فروردین 2021، صفحه 283-289 اصل مقاله (149.43 K) | ||
| نوع مقاله: Original Manuscript | ||
| شناسه دیجیتال (DOI): 10.22044/jas.2020.9086.1441 | ||
| نویسندگان | ||
| Z. Gholami؛ M. Gholami* | ||
| Department of Mathematics, University of Shahrekord, P.O. Box 8818634141, Shahrekord, Iran. | ||
| چکیده | ||
| Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-rate performance. Moreover, some explicit constructions for exponent matrices of conventional APM-LDPC codes with girth at least 6 have been investigated. In this paper, a class of 4-cycle free APM-LDPC codes is constructed by a new explicit method such that the constructed codes have better cycle distributions rather than the recently proposed APM codes with girth 6. As simulation results show, the constructed codes outperform PEG and random-like LDPC codes with the same rates and lengths. | ||
| کلیدواژهها | ||
| APM-LDPC codes؛ explicit constructions؛ girth | ||
|
آمار تعداد مشاهده مقاله: 940 تعداد دریافت فایل اصل مقاله: 475 |
||