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.


Published in:
International Symposium on Information Theory 2005, 1382-1385
Presented at:
International Symposium on Information Theory 2005, Adelaide, Australia, 4-9 September 2005
Year:
2005
Keywords:
Laboratories:




 Record created 2007-03-08, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)