DocumentCode
31539
Title
Universal Communication—Part I: Modulo Additive Channels
Author
Lomnitz, Yuval ; Feder, Meir
Author_Institution
Dept. of Electr. Eng.-Syst., Tel-Aviv Univ., Ramat-Aviv, Israel
Volume
59
Issue
9
fYear
2013
fDate
Sept. 2013
Firstpage
5488
Lastpage
5510
Abstract
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, a “capacity” is defined 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 without feedback, i.e., use the same encoder and decoder over each block. In the case of the 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 a function of the finite state compressibility of the noise sequence. A universal communication scheme with feedback that attains this capacity universally, without prior knowledge of the noise sequence, is presented.
Keywords
AWGN channels; encoding; stochastic processes; block communication scheme; finite state compressibility; finite-state compressibility; modulo additive channels; noise sequence; output sequence; stochastic function; universal communication; Additives; Decoding; Encoding; Error probability; Nickel; Noise; Vectors; Arbitrarily varying channels (AVCs); feedback communication; individual sequences; rateless coding; universal communication; unknown channels;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2266333
Filename
6557005
Link To Document