TY - GEN
T1 - On the rate-limited gelfand-pinsker problem
AU - Tandon, Ravi
AU - Ulukus, Sennur
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449476759&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449476759&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2009.5205681
DO - 10.1109/ISIT.2009.5205681
M3 - Conference contribution
AN - SCOPUS:70449476759
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1963
EP - 1967
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -