A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available with perfect (causal) feedback for communication. A recent result  shows the existence, for certain families of channels (e.g. Binary Symmetric Channels and Z channels), of coding schemes that achieve Burnashev's exponent universally over these families. In other words, in certain cases, there is no loss in the error exponent by ignoring the channel: transmitter and receiver can design optimaldoi:10.1109/tit.2005.864468 fatcat:qtgtku2nurbxxpxt5g7bvantom