Elements of information theory
Elements of information theory
Channel Coding in the Presence of Side Information
Foundations and Trends in Communications and Information Theory
Capacity of a class of modulo-sum relay channels
IEEE Transactions on Information Theory
Hi-index | 0.02 |
We study a rate-limited version of the well known problem of coding for channels with random parameters which was studied by Gelfand and Pinsker [1]. In particular, we consider a state-dependent channel when the transmitter is supplied with the state information at a rate Re, We obtain a new upper bound on the capacity, C(Re), for this channel. We explicitly evaluate this upper bound for the rate-limited dirty paper coding (DPC) problem and show that it strictly improves upon the DPC capacity for certain values of Re.