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

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 535-

  Khisti, Ashish ^a   Erez, Uri ^a   Wornell, Gregory ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CHANNELS; DIRTY PAPER; INTERFERENCE SEQUENCES; TIME SHARING;

BINARY CODES; BOUNDARY VALUE PROBLEMS; ELECTRICAL ENGINEERING; NUMERICAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; RELIABILITY; SET THEORY; SIGNAL ENCODING; SIGNAL INTERFERENCE; SIGNAL RECEIVERS; THEOREM PROVING; TRANSMITTERS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 5044247134     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. S. I. Gel'fand and M. S. Pinsker, "Coding for Channel with Random Parameters," Prob. Contr. Inform. Theory, Vol. 9, No. 1, pp. 19-31, 1980.
2. C. Heegard and A. A. El Gamal, "On the Capacity of Computer Memory with Defects," IEEE Trans. Inform. Theory, Vol. 29, pp. 731-739, Sep. 1983.
3. M. Costa, "Writing on Dirty Paper," IEEE Trans. Inform. Theory, Vol. 29, No. 3, pp. 439-441, May 1983.
4. A. Khisti, SM Thesis, MIT, in preparation.