On the zero-rate error exponent for a BSC with noisy feedback
Problems of Information Transmission
Communication under strong asynchronism
IEEE Transactions on Information Theory
The error exponent of variable-length codes over Markov channels with feedback
IEEE Transactions on Information Theory
Feedback capacity of the compound channel
IEEE Transactions on Information Theory
Rateless coding for arbitrary channel mixtures with decoder channel state information
IEEE Transactions on Information Theory
Noisy feedback improves the BSC reliability function
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Feedback communication over individual channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Some observations on limited feedback for multiaccess channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Achieving the empirical capacity using feedback: memoryless additive models
IEEE Transactions on Information Theory
A training based scheme for communicating over unknown channels with feedback
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
IEEE Transactions on Information Theory
Zero-rate feedback can achieve the empirical capacity
IEEE Transactions on Information Theory
Variable-rate channel capacity
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the reliability function for a BSC with noisy feedback
Problems of Information Transmission
A little feedback can simplify sensor network cooperation
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
Hi-index | 755.38 |
Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that the coding scheme is designed knowing only that the channel belongs to a family Q of DMCs. Is there a coding scheme with noiseless feedback that achieves Burnashev's exponent uniformly over Q at a nontrivial rate? We answer the question in the affirmative for two families of channels (binary symmetric, and Z). For these families we show that, for any given fraction, there is a feedback coding strategy such that for any member of the family: i) guarantees this fraction of its capacity as rate, and ii) guarantees the corresponding Burnashev's exponent. Therefore, for these families, in terms of delay and error probability, the knowledge of the channel becomes asymptotically irrelevant in feedback code design: there are blind schemes that perform as well as the best coding scheme designed with the foreknowledge of the channel under use. However, a converse result shows that, in general, even for families that consist of only two channels, such blind schemes do not exist.