2000 character limit reached
Non-Binary LDPC Codes with Large Alphabet Size (1401.7290v1)
Published 28 Jan 2014 in cs.IT and math.IT
Abstract: We study LDPC codes for the channel with input ${x}\in \mathbb{F}_qm$ and output ${y}={x}+{z}\in \mathbb{F}_qm$. The aim of this paper is to evaluate decoding performance of $qm$-ary non-binary LDPC codes for large $m$. We give density evolution and decoding performance evaluation for regular non-binary LDPC codes and spatially-coupled (SC) codes. We show the regular codes do not achieve the capacity of the channel while SC codes do.