Interference management via capacity-achieving codes for the deterministic broadcast channel

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005

Volumn , Issue , 2005, Pages 29-33

  Coleman, Todd P ^a   Martinian, Emin ^b   Effros, Michelle ^c   Médard, Muriel ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING STRATEGIES; DETERMINISTIC BROADCAST CHANNEL PROBLEM; LUBY TRANSFORM CODE;

ALGORITHMS; BROADCASTING; DECODING; ENCODING (SYMBOLS); PROBLEM SOLVING; SIGNAL INTERFERENCE;

CHANNEL CAPACITY;

EID: 33749078805     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2005.1531850     Document Type: Conference Paper

References (17)

1. H. Weingarten, Y. Steinberg, and S. Shamai, "The capacity region of the Gaussian MIMO broadcast channel," in IEEE International Symposium on Information Theory, Chicago, IL, June 2004.
2. M. Costa, "Writing on dirty paper," IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 439-441, May 1983.
3. U. Erez and S. ten Brink, "Approaching the dirty paper limit in canceling known interference," in Allerton Conference on Communication, Control, and Computing, 2004.
4. Y. Sun, A. D. Liveris, V. Stankovic, and Z. Xiong, "Near-capacity dirty-paper code design: A source-channel coding approach," in Conference on Information Sciences and Systems, John Hopkins University, March 2005.
5. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting codes and decoding: Turbo codes," Proc. IEEE International Communications Conference, 1993.
6. R. Gallager, "Low-density parity-check codes," IRE Transactions on Information Theory, vol. 8, pp. 21-28, Jan. 1962.
7. K. Marton, "The capacity region of deterministic broadcast channels," in IEEE International Symposium on Information Theory, Paris-Cachan, France, 1977.
8. M. S. Pinsker, "Capacity of noiseless broadcast channels," Probl. Inform. Transm., pp. 97-102, 1978.
9. K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Transactions on Information Theory, vol. 25, no. 3, pp. 306-311, 1979.
10. T. P. Coleman, M. Effros, E. Martinian, and M. Medard, "Rate-splitting for the deterministic broadcast channel," in IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.
11. T. Cover, "Enumerative source coding," IEEE Transactions on Information Theory, vol. 19, no. 1, pp. 73-77, Jan 1973.
12. M. Luby, "LT codes," Foundations of Computer Science, pp. 271-280, November 2002.
13. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471-480, 1973.
14. R. Gallager, Information Theory and Reliable Communication, John Wiley & Sons, New York, NY, 1968.
15. I. Csiszár, "The method of types," IEEE Transactions on Information Theory, vol. 44, no. 6, pp. 2205-2523, 1998.
16. E. Martinian and J. S. Yedida, "Iterative quantization using codes on graphs," in Allerton Conference on Communication, Control, and Computing, 2003, http://arxiv.org/abs/cs.IT/0408008.
17. G. D. Forney, "Codes on graphs: Normal realizations," IEEE Transactions on Information Theory, pp. 101-112, 2001.