We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the ε-capacity as well as necessary and sufficient conditions for the strong converse property for such channels when the sequence of channel states is not necessarily stationary, memoryless, or ergodic. We then seek a finer characterization of these capacities in terms of second-order coding rates. The general results are supplemented by several examples including independent identically distributed and Markov states and mixed channels. © 2014 IEEE
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting wh...
Determining the achievable rates at which information can be reliably transmitted across noisy chann...
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple...
We consider state-dependent memoryless channels with general state available at both encoder and dec...
Abstract—We consider state-dependent memoryless channels with general state available at both encode...
We consider an information theoretic model of a communication channel with a time-varying probabilit...
This paper studies second-order coding rates for memoryless channels with a state sequence known non...
This paper studies second-order coding rates for memoryless channels with a state sequence known non...
We consider the problem of optimal probing of states of a channel by transmitter and receiver for ma...
We consider a two-user state-dependent multiaccess channel in which only one of the encoders is info...
International audienceWe consider a two-user state-dependent multiaccess channel in which only one o...
We consider a state-dependent multiaccess channel (MAC) with state noncausally known to some encoder...
Abstract—We derive the second-order capacities (supremum of second-order coding rates) for erasure a...
This paper presents an achievable second-order rate region for the discrete memoryless multiple-acce...
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and l...
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting wh...
Determining the achievable rates at which information can be reliably transmitted across noisy chann...
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple...
We consider state-dependent memoryless channels with general state available at both encoder and dec...
Abstract—We consider state-dependent memoryless channels with general state available at both encode...
We consider an information theoretic model of a communication channel with a time-varying probabilit...
This paper studies second-order coding rates for memoryless channels with a state sequence known non...
This paper studies second-order coding rates for memoryless channels with a state sequence known non...
We consider the problem of optimal probing of states of a channel by transmitter and receiver for ma...
We consider a two-user state-dependent multiaccess channel in which only one of the encoders is info...
International audienceWe consider a two-user state-dependent multiaccess channel in which only one o...
We consider a state-dependent multiaccess channel (MAC) with state noncausally known to some encoder...
Abstract—We derive the second-order capacities (supremum of second-order coding rates) for erasure a...
This paper presents an achievable second-order rate region for the discrete memoryless multiple-acce...
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and l...
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting wh...
Determining the achievable rates at which information can be reliably transmitted across noisy chann...
This paper studies the second-order asymptotics of coding rates for the discrete memoryless multiple...