DocumentCode
2062394
Title
Writing on many pieces of dirty paper at once: the binary case
Author
Khisti, Ashish ; Erez, Uri ; Wornell, Gregory
Author_Institution
Dept. of Electr. Eng. & Comput. Sci.,, MIT, Cambridge, MA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
535
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.
Keywords
channel capacity; channel coding; intersymbol interference; additive interference; binary channel; channel side information; signal transmission; writing-on-dirty paper; Channel coding; Computer aided software engineering; Decoding; Intersymbol interference; MIMO; Random variables; Time sharing computer systems; Transmitters; Watermarking; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365570
Filename
1365570
Link To Document