TY - GEN

T1 - Error Exponents of Typical Random Codes for the Colored Gaussian Channel

AU - Merhav, Neri

N1 - Publisher Copyright: © 2019 IEEE.

PY - 2019/7

Y1 - 2019/7

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85073149678&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/ISIT.2019.8849653

DO - https://doi.org/10.1109/ISIT.2019.8849653

M3 - منشور من مؤتمر

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2669

EP - 2673

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -