Abstract—We consider the problem of universally communi-cating over an unknown and arbitrarily varying channel, using feedback. The focus of this paper is on determining the input behavior, and specifically, a prior distribution which is used to randomly generate the codebook. We pose the problem of setting the prior as a sequential universal prediction problem, that attempts to approach a given target rate, which depends on the unknown channel sequence. The main result is that, for a channel comprised of an unknown, arbitrary sequence of memoryless channels, there is a system using feedback and common randomness that asymptotically attains, with high prob-ability, the capacity of the time-averaged channel, universally for every sequence of...
Consider a random access communication scenario over a channel whose operation is defined for any nu...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where...
Abstract—Consider communication over a channel whose probabilistic model is completely unknown vecto...
Abstract—We address the problem of universal communications over an unknown channel with an instanta...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is cons...
Abstract—Which communication rates can be attained over a channel whose output is an unknown (possib...
Abstract—We consider the problem of communicating over a channel for which no mathematical model is ...
The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an a...
The utility of limited feedback for coding over an individual sequence of discrete memoryless channe...
Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, wit...
Abstract—Burnashev in 1976 gave an exact expression for the reliability function of a discrete memor...
We investigate the maximum coding rate for a given average blocklength and error probability over a ...
Abstract-Random coding theorems are proved for discrete memory-less arbitrarily varying channels (AV...
A universal approach to the design of communication systems for unknown and time-varying channels is...
Consider a random access communication scenario over a channel whose operation is defined for any nu...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where...
Abstract—Consider communication over a channel whose probabilistic model is completely unknown vecto...
Abstract—We address the problem of universal communications over an unknown channel with an instanta...
Communication over unknown binary symmetric channels with instantaneous and perfect feedback is cons...
Abstract—Which communication rates can be attained over a channel whose output is an unknown (possib...
Abstract—We consider the problem of communicating over a channel for which no mathematical model is ...
The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an a...
The utility of limited feedback for coding over an individual sequence of discrete memoryless channe...
Suppose Q is a family of discrete memoryless channels. An unknown member of Q will be available, wit...
Abstract—Burnashev in 1976 gave an exact expression for the reliability function of a discrete memor...
We investigate the maximum coding rate for a given average blocklength and error probability over a ...
Abstract-Random coding theorems are proved for discrete memory-less arbitrarily varying channels (AV...
A universal approach to the design of communication systems for unknown and time-varying channels is...
Consider a random access communication scenario over a channel whose operation is defined for any nu...
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with c...
We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where...