Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Tu-PM-1-1
Session:
Number:Tu-PM-1-1.3
On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes
Pavel Rybin, Alexey Frolov,
pp.384-388
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Tu-PM-1-1.3
PDF download
Summary:
In this paper we consider the low complexity majority-logic decoding algorithm for irregular non-binary lowdensity parity-check (LDPC) codes. The decoding algorithm is a generalization of the bit-flipping algorithm for binary LDPC codes. The lower estimate on the decoding radius realized by this algorithm is derived for the first time for irregular non-binary LDPC codes. We present the numerical results for the derived lower bound.