Writing on many pieces of dirty paper at once: The binary case

Ashish Khisti; Uri Erez; Gregory Wornell

Writing on many pieces of dirty paper at once: The binary case

Ashish Khisti^*, Uri Erez, Gregory Wornell

^*Corresponding author for this work

Massachusetts Institute of Technology

Research output: Contribution to journal › Conference article › peer-review

17 Scopus citations

Abstract

We study the problem of sending a common message to several users on a channel with side information. Specifically, each user experiences an additive interference which is known only to the sender. The sender has to simultaneously adapt its transmitted signal to all the interferences. We derive upper and lower bounds for the special case of binary channels and derive some optimality conditions.

Original language	English
Pages (from-to)	535
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
State	Published - 2004
Externally published	Yes
Event	Proceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States Duration: 27 Jun 2004 → 2 Jul 2004

Cite this

@article{57e07af3a96645b4b924931f08d90b15,

title = "Writing on many pieces of dirty paper at once: The binary case",

abstract = "We study the problem of sending a common message to several users on a channel with side information. Specifically, each user experiences an additive interference which is known only to the sender. The sender has to simultaneously adapt its transmitted signal to all the interferences. We derive upper and lower bounds for the special case of binary channels and derive some optimality conditions.",

author = "Ashish Khisti and Uri Erez and Gregory Wornell",

year = "2004",

language = "אנגלית",

pages = "535",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8097",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings - 2004 IEEE International Symposium on Information Theory ; Conference date: 27-06-2004 Through 02-07-2004",

}

TY - JOUR

T1 - Writing on many pieces of dirty paper at once

T2 - Proceedings - 2004 IEEE International Symposium on Information Theory

AU - Khisti, Ashish

AU - Erez, Uri

AU - Wornell, Gregory

PY - 2004

Y1 - 2004

N2 - We study the problem of sending a common message to several users on a channel with side information. Specifically, each user experiences an additive interference which is known only to the sender. The sender has to simultaneously adapt its transmitted signal to all the interferences. We derive upper and lower bounds for the special case of binary channels and derive some optimality conditions.

AB - We study the problem of sending a common message to several users on a channel with side information. Specifically, each user experiences an additive interference which is known only to the sender. The sender has to simultaneously adapt its transmitted signal to all the interferences. We derive upper and lower bounds for the special case of binary channels and derive some optimality conditions.

UR - http://www.scopus.com/inward/record.url?scp=5044247134&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:5044247134

SN - 2157-8097

SP - 535

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

Y2 - 27 June 2004 through 2 July 2004

ER -

Writing on many pieces of dirty paper at once: The binary case

Abstract

Other files and links

Fingerprint

Cite this