Carbon copying onto dirty paper

Ashish Khisti*, Gregory Wornell, Uri Erez, Amos Lapidoth

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference, which is known noncausally to the transmitter but not to any of the receivers. In this work, we focus on the Gaussian case with two users and independent interferences. We provide upper and lower bounds on capacity. At high interference-to-noise ratios, we show that time-sharing is (asymptotically) optimal. This settles the conjecture by Steinberg and Shamai [10]. At high signal-to-noise ratios, we propose a superposition dirty paper code that achieves within 1/4 bit/symbol of capacity. An extension to the case of correlated interferences is also discussed.

Original languageEnglish
Title of host publicationIEEE 2006 International Zurich Seminar on Digital Communications - Proceedings
Number of pages4
StatePublished - 2006
EventIEEE 2006 International Zurich Seminar on Digital Communications - Zurich, Switzerland
Duration: 22 Feb 200624 Feb 2006

Publication series

NameInternational Zurich Seminar on Digital Communications


ConferenceIEEE 2006 International Zurich Seminar on Digital Communications


Dive into the research topics of 'Carbon copying onto dirty paper'. Together they form a unique fingerprint.

Cite this