.png){kind=icon}
Return
Algebraic-Based Nonbinary LDPC Codes with Flexible Field Orders and Code Rates
.png){kind=icon}
PRE
AI
DOI：10.1109/CC.2017.7927569.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we study the rank of matrices over GF(2(p)), and propose two construction methods for algebraic-based nonbinary LDPC codes from an existing LDPC code, referred to as the original code. By multiplying all elements of each column of the binary parity-check matrix H corresponding to the original code with the same nonzero element of any field, the first class of nonbinary LDPC codes with flexible field order is proposed. The second method is to replace the nonzero elements of some columns in H with different nonzero field elements in a given field, and then another class of nonbinary LDPC codes with various rates is obtained. Simulation results show that the proposed nonbinary LDPC codes perform well over the AWGN channel with the iterative decoding algorithms.
Keywords:
nonbinary LDPC codes
algebraic-based LDPC codes
rank
iterative algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
1.9K
Citations:
5.0K
Organization
Cited Papers
No cited papers available