Bounds on the Error Probability of Nonbinary Linear Codes over the Q-ary Symmetric Channel

The block error probability under maximum likelihood decoding of general linear block codes and code ensembles over the q-ary symmetric channel is analyzed. The analysis makes use of two types of upper bounds and it is based on the codes (code ensembles) distance spectra. The first bound generalizes Poltyrev's union bound for the binary symmetric channel. The second bound relies on typical pairs decoding. The two bounds are developed in an asymptotic setting to analyze the behavior of linear block code ensembles, in terms of error exponent and maximum-likelihood decoding threshold. A sphere-packing lower bound is also developed, to provide a reference for the finite-length performance.

[1]  Robert J. McEliece,et al.  BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding , 2001 .

[2]  John J. Metzner.  Majority-logic-like decoding of vector symbols , 1996, IEEE Trans. Commun..

[3]  Fan Zhang,et al.  Analysis of Verification-Based Decoding on the q -ary Symmetric Channel for Large q , 2008, IEEE Trans. Inf. Theory.

[4]  Gianluigi Liva,et al.  Symbol Message Passing Decoding of Nonbinary Spatially-Coupled Low-Density Parity-Check Codes , 2019, 2019 AEIT International Annual Conference (AEIT).

[5]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[6]  Marco Baldi,et al.  Using Non-Binary LDPC and MDPC Codes in the McEliece Cryptosystem , 2019, 2019 AEIT International Annual Conference (AEIT).

[7]  Andrea Shokrollahi,et al.  Capacity-approaching codes on the q-ary symmetric channel for large q , 2004, Information Theory Workshop.

[8]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[9]  Robert J. McEliece,et al.  Coding theorems for turbo code ensembles , 2002, IEEE Trans. Inf. Theory.

[10]  Michael Mitzenmacher,et al.  Verification-based decoding for packet-based low-density parity-check codes , 2005, IEEE Transactions on Information Theory.

[11]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[12]  K. Yamaguchi,et al.  Density Evolution for GF(q) LDPC Codes Via Simplified Message-passing Sets , 2007, 2007 Information Theory and Applications Workshop.

[13]  C. Weidmann,et al.  Optimization of binary LDPC codes for the q-ary symmetric channel with moderate q , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[14]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[15]  Alexandre Graell i Amat,et al.  Symbol Message Passing Decoding of Nonbinary Low-Density Parity-Check Codes , 2019, 2019 IEEE Global Communications Conference (GLOBECOM).

[16]  David Burshtein,et al.  Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.

[17]  Babak Hassibi,et al.  On the Performance of Sphere Decoding of Block Codes , 2009, 2006 IEEE International Symposium on Information Theory.