Error Exponents of Typical Random Codes for the Colored Gaussian Channel

12/15/2018
by   Neri Merhav, et al.
0

The error exponent of the typical random code is defined as the asymptotic normalized expectation of the logarithm of the probability of error, as opposed to the traditional definition of the random coding exponent as the normalized logarithm of the expectation of the probability of error with respect to a given ensemble of codes. For a certain ensemble of independent codewords, with a given power spectrum, and a generalized stochastic mismatched decoder, we characterize the error exponent the typical random codes (TRC) for the colored Gaussian channel, with emphasis on the range of low rates, where the TRC error exponent differs in value from the ordinary random coding error exponent. The error exponent formula, which is exponentially tight at some range of low rates, is presented as the maximum of a certain function with respect to one parameter only (in the spirit of Gallager's formulas) in the case of matched decoding, and two parameters in the case of mismatched decoding. Several aspects of the main results are discussed. These include: general properties, a parametric representation, critical rates, phase transitions, optimal input spectrum (water pouring), and comparison to the random coding exponent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2022

Generalized Random Gilbert-Varshamov Codes: Typical Error Exponent and Concentration Properties

We find the exact typical error exponent of constant composition general...
research
03/04/2019

Error Exponents of Typical Random Trellis Codes

In continuation to an earlier work, where error exponents of typical ran...
research
10/01/2019

Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...
research
08/12/2019

A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code

A Lagrange-dual (Gallager-style) lower bound is derived for the error ex...
research
05/07/2018

Generalized Random Gilbert-Varshamov Codes

We introduce a random coding technique for transmission over discrete me...
research
09/18/2020

On More General Distributions of Random Binning for Slepian-Wolf Encoding

Traditionally, ensembles of Slepian-Wolf (SW) codes are defined such tha...
research
08/23/2021

Decoding Error Probability of the Random Matrix Ensemble over the Erasure Channel

Using tools developed in a recent work by Shen and the second author, in...

Please sign up or login with your details

Forgot password? Click here to reset