List Message Passing Decoding of Non-binary Low-Density Parity-Check Codes
Emna Ben Yacoub

TL;DR
This paper introduces a list message passing decoding algorithm for non-binary LDPC codes over the q-ary symmetric channel, demonstrating improved thresholds and confirming results through finite-length simulations.
Contribution
It presents a novel list message passing decoding method for non-binary LDPC codes with density evolution analysis and improved thresholds over existing algorithms.
Findings
Thresholds for regular LDPC ensembles are improved.
Finite-length simulations confirm asymptotic analysis.
Maximum list size impacts decoding performance.
Abstract
A decoding algorithm for -ary low-density parity-check codes over the -ary symmetric channel is introduced. The exchanged messages are lists of symbols from . A density evolution analysis for maximum list sizes and is developed. Thresholds for selected regular low-density parity-check code ensembles are computed showing gains with respect to a similar algorithm in the literature. Finite-length simulation results confirm the asymptotic analysis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
