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

A decoding algorithm for \(q\)-ary low-density parity-check codes over the \(q\)-ary symmetric channel is introduced. The exchanged messages are lists of symbols from \(\Fq\). A density evolution analysis for maximum list sizes \(1\) and \(2\) is developed. Thresholds for selected regular low-densit...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-04
Main Author: Emna Ben Yacoub
Format: Article
Language:English
Subjects:
Algorithms
Binary system
Codes
Decoding
Density
Error correcting codes
Graphs
Message passing
Parity
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A decoding algorithm for \(q\)-ary low-density parity-check codes over the \(q\)-ary symmetric channel is introduced. The exchanged messages are lists of symbols from \(\Fq\). A density evolution analysis for maximum list sizes \(1\) and \(2\) 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.
ISSN:2331-8422