Elements of information theory
Elements of information theory
A framework for low-complexity communication over channels with feedback
A framework for low-complexity communication over channels with feedback
Private Codes or Succinct Random Codes That Are (Almost) Perfect
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Common randomness in information theory and cryptography. II. CR capacity
IEEE Transactions on Information Theory
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
Fast iterative coding techniques for feedback channels
IEEE Transactions on Information Theory
Variable length coding over an unknown channel
IEEE Transactions on Information Theory
Feedback does not increase the capacity of discrete channels with additive noise
IEEE Transactions on Information Theory
Some observations on limited feedback for multiaccess channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Zero-rate feedback can achieve the empirical capacity
IEEE Transactions on Information Theory
Variable-rate channel capacity
IEEE Transactions on Information Theory
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 | 754.96 |
We address the problem of universal communications over an unknown channel with an instantaneous noiseless feedback, and show how rates corresponding to the empirical behavior of the channel can be attained, although no rate can be guaranteed in advance. First, we consider a discrete modulo-additive channel with alphabet X, where the noise sequence Zn is arbitrary and unknown and may causally depend on the transmitted and received sequences and on the encoder's message, possibly in an adversarial fashion. Although the classical capacity of this channel is zero, we show that rates approaching the empirical capacity |X| - Hemp (Zn) can be universally attained, where Hemp (Zn) is the empirical entropy of Zn. For the more general setting, where the channel can map its input to an output in an arbitrary unknown fashion subject only to causality, we model the empirical channel actions as the modulo-addition of a realized noise sequence, and show that the same result applies if common randomness is available. The results are proved constructively, by providing a simple sequential transmission scheme approaching the empirical capacity.