This paper presents two low-complexity reliability-based message-passing algorithms for decoding LDPC codes over non-binary finite fields. These two decoding algorithms require only finite field and integer operations and they provide effective trade-off between error performance and decoding complexity compared to the non-binary sum product algorithm. They are particularly effective for decoding LDPC codes constructed based on finite geometries and finite fields.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2010) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: