A Fresh Look at Coding for q-ary Symmetric Channels

DOI10.1109/TIT.2012.2208576MaRDI QIDQ2989715zbMATH OpenWikidataFDO

Authors Claudio Weidmann, Gottfried Lechner

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.2009

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: This paper studies coding schemes for the $q$-ary symmetric channel based on binary low-density parity-check (LDPC) codes that work for any alphabet size $q=2^m$, $minmathbbN$, thus complementing some recently proposed packet-based schemes requiring large $q$. First, theoretical optimality of a simple layered scheme is shown, then a practical coding scheme based on a simple modification of standard binary LDPC decoding is proposed. The decoder is derived from first principles and using a factor-graph representation of a front-end that maps $q$-ary symbols to groups of $m$ bits connected to a binary code. The front-end can be processed with a complexity that is linear in $m=lo{g}_{2}q$. An extrinsic information transfer chart analysis is carried out and used for code optimization. Finally, it is shown how the same decoder structure can also be applied to a larger class of $q$-ary channels.

This page was built for publication: A Fresh Look at Coding for $q$-ary Symmetric Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989715)