TY - JOUR
T1 - Achieving the empirical capacity using feedback
T2 - Memoryless additive models
AU - Shayevitz, Ofer
AU - Feder, Meir
N1 - Funding Information:
Manuscript received November 22, 2006; revised August 29, 2008. Current version published February 25, 2009. This work was supported in part by the Israel Science Foundation under Grant 223/05. The work of O. Shayevitz was supported by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities. The material in this paper was presented in part at the IEEE International Symposium on Information Theory (ISIT), Adelaide, Australia, September 2005.
PY - 2009
Y1 - 2009
N2 - 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 log 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.
AB - 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 log 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.
KW - Adversarial channels
KW - Arbitrarily varying channels
KW - Feedback communications
KW - Individual sequences
KW - Universal communications
UR - http://www.scopus.com/inward/record.url?scp=62749132915&partnerID=8YFLogxK
U2 - 10.1109/TIT.2008.2011434
DO - 10.1109/TIT.2008.2011434
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:62749132915
SN - 0018-9448
VL - 55
SP - 1269
EP - 1295
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 3
ER -