Capacity of a class of modulo-sum relay channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 596-600

  Aleksic, Marko ^a   Razaghi, Peyman ^a   Yu, Wei ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION-THEORY; INTERNATIONAL SYMPOSIUM; RELAY CHANNELS;

CYBERNETICS;

EID: 51649114814     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557290     Document Type: Conference Paper

References (8)

1. T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inform. Theory, vol. 25, no. 5, pp. 572-584, Sept. 1979.
2. S. Zahedi, "On reliable communication over relay channels," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2005.
3. A. El Gamal and M. Aref, "The capacity of the semideterministic relay channel," IEEE Trans. Inform. Theory, vol. 28, no. 3, p. 536, May 1982.
4. T. M. Cover and Y.-H. Kim, "Capacity of a class of deterministic relay channels," in Proc. IEEE Int. Symp. Information Theory, June 2007.
5. Z. Zhang, "Partial converse for a relay channel," IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 1106-1110, Sept. 1988.
6. R. Ahlswede and T. S. Han, "On souce coding with side information via a multiple-access channel and related problems in multi-user information theory," IEEE Trans. Inform. Theory, vol. 29, no. 3, pp. 396-412, May 1983.
7. T. M. Cover and J. S. Thomas, Elements of Information Theory. New York: Wiley, 1991.
8. A. D. Wyner and J. Ziv, "A theorem on the entropy of certain binary sequences and applications: Part I," IEEE Trans. Inform. Theory, vol. 19, no. 6, pp. 769-772, Nov 1973.