加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本