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.
Bounds on the error probability of nonbinary linear codes over the Q-ary symmetric channel / Yacoub E.B.; Liva G.; Paolini E.. - ELETTRONICO. - (2021), pp. 9400302.1-9400302.6. (Intervento presentato al convegno 55th Annual Conference on Information Sciences and Systems, CISS 2021 tenutosi a Baltimore, MD, USA nel 2021) [10.1109/CISS50987.2021.9400302].
Bounds on the error probability of nonbinary linear codes over the Q-ary symmetric channel
Paolini E.
2021
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
