@article{1cc3fb1683f24306a75e6ee630b175ce,
title = "An upper bound on the capacity of the causal dirty-paper channel",
abstract = "A bound on the capacity of the causal dirty-paper channel with arbitrary interference and general independent identically distributed additive noise is derived. In particular, it is shown that for the case of Gaussian noise, the capacity is upper bounded by log2(1+SNR/e) bits per real dimension. This bound is useful for SNR ≤ e(e-2).",
keywords = "Causal channel state information, dirty-paper channel, lattice strategies, modulo-lattice channels",
author = "Mustafa Kesal and Uri Erez",
note = "Funding Information: Manuscript received April 30, 2010; revised December 21, 2010; accepted December 21, 2010. Date of current version August 31, 2011. This work was supported in part by the Israel Science Foundation under Grant ISF1234/09 and by the Binational Science Foundation under Grant BSF2008455. This work was presented in part at the IEEE International Symposium on Information Theory, Austin, TX, June 13–18, 2010.",
year = "2011",
month = sep,
doi = "10.1109/TIT.2011.2162261",
language = "אנגלית",
volume = "57",
pages = "5650--5659",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",
}