TY - GEN

T1 - Universal communication over modulo-additive individual noise sequence channels

AU - Lomnitz, Yuval

AU - Feder, Meir

PY - 2011

Y1 - 2011

N2 - Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state compressibility of a sequence defined by Lempel and Ziv, we define a capacity for such a channel as the highest rate achievable by a designer knowing the particular relation that indeed exists between the input and output for all times, yet is constrained to use a fixed finite-length block communication scheme (i.e., use the same scheme over each block). In the case of the binary modulo additive channel, where the output sequence is obtained by modulo addition of an unknown individual sequence to the input sequence, this capacity is upper bounded by 1-ρ where is the finite state compressibility of the noise sequence. We present a communication scheme with feedback that attains this rate universally without prior knowledge of the noise sequence.

AB - Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state compressibility of a sequence defined by Lempel and Ziv, we define a capacity for such a channel as the highest rate achievable by a designer knowing the particular relation that indeed exists between the input and output for all times, yet is constrained to use a fixed finite-length block communication scheme (i.e., use the same scheme over each block). In the case of the binary modulo additive channel, where the output sequence is obtained by modulo addition of an unknown individual sequence to the input sequence, this capacity is upper bounded by 1-ρ where is the finite state compressibility of the noise sequence. We present a communication scheme with feedback that attains this rate universally without prior knowledge of the noise sequence.

UR - http://www.scopus.com/inward/record.url?scp=80054825341&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6033972

DO - 10.1109/ISIT.2011.6033972

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:80054825341

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 229

EP - 233

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -