Conference paper

On the universality of Burnashev's error exponent

We consider communication over a time invariant discrete memoryless channel with noiseless and instantaneous feedback. We assume that the communicating parties are not aware of the underlying channel, however they know that it belongs to some specific family of discrete memoryless channels. Recent results (A. Tchamkerten and I.E. Telatar) show that for certain families (e.g., binary symmetric channels and Z channels) there exists coding schemes that universally achieve any rate below capacity while attaining Burnashev's error exponent. We show that this is not the case in general by deriving an upper bound to the universally achievable error exponent.

    Keywords: NCCR-MICS ; NCCR-MICS/CL1


    • LTHI-CONF-2007-007

    Record created on 2007-03-08, modified on 2017-05-12

Related material