@inproceedings{dfa6f6438ade444e92c118a77130419a,
title = "On the universality of Burnashev's error exponent",
abstract = "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 [4] 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.",
author = "Asian Tchamkerten and Telatar, \{I. Emre\}",
year = "2005",
month = jan,
day = "1",
doi = "10.1109/ISIT.2005.1523569",
language = "English",
isbn = "0780391519",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1382--1385",
booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05",
note = "2005 IEEE International Symposium on Information Theory, ISIT 2005 ; Conference date: 04-09-2005 Through 09-09-2005",
}