TY - GEN
T1 - On the universality of Burnashev's error exponent
AU - Tchamkerten, Asian
AU - Telatar, I. Emre
PY - 2005/12/1
Y1 - 2005/12/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/33749437068
U2 - 10.1109/ISIT.2005.1523569
DO - 10.1109/ISIT.2005.1523569
M3 - Conference contribution
AN - SCOPUS:33749437068
SN - 0780391519
SN - 9780780391512
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1382
EP - 1385
BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -