Capacity of a class of modulo-sum relay channels

IEEE Transactions on Information Theory

Volumn 55, Issue 3, 2009, Pages 921-930

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

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Channel with side information; Cut set bound; Modulo sum channel; Quantize and forward; Relay channel

Indexed keywords

CHANNEL WITH SIDE INFORMATION; CUT-SET BOUND; MODULO-SUM CHANNEL; QUANTIZE-AND-FORWARD; RELAY CHANNEL;

TRANSMITTERS;

EID: 62749159755     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2011518     Document Type: Article

References (16)

1. T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. IT-25, no. 5, pp. 572-584, Sep. 1979.
2. A. El Gamal and M. Aref, "The capacity of the semideterministic relay channel," IEEE Trans. Inf. Theory, vol. IT-28, no. 3, pp. 536-536, May 1982.
3. A. El Gamal and S. Zahedi, "Capacity of a class of relay channels with orthogonal components," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1815-1817, May 2005.
4. Y. H. Kim, "Capacity of a class of deterministic relay channels," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1328-1329, Mar. 2008.
5. G. Kramer, M. Gastpar, and P. Gupta, "Cooperative strategies and capacity theorems for relay networks," IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037-3062, Sep. 2005.
6. Y. Liang and V. V. Veeravalli, "Gaussian orthogonal relay channels: Optimal resource allocation and capacity," IEEE Trans. Inf. Theory vol. 51, no. 9, pp. 3284-3289, Sep. 2005.
7. Z. Zhang, "Partial converse for a relay channel," IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1106-1110, Sep. 1988.
8. S. Zahedi, "On Reliable Communication Over Relay Channels," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2005.
9. S. I. Gel'fand and S. M. Pinsker, "Coding for the channel with random parameters," Probl. Contr. and Inf. Theory, vol. 9, no. 1, pp. 19-31, 1980.
10. 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. Inf. Theory, vol. IT-29, no. 3, pp. 396-412, May 1983.
11. C. Heegard and A. El Gamal, "On the capacity of computer memory with defects," IEEE Trans. Inf. Theory, vol. IT-29, no. 5, pp. 731-739, Sep. 1983.
12. A. Rosenzweig, Y. Steinberg, and S. Shamai (Shitz), "On channels with partial channel state information at the transmitter," IEEE Trans. Inf. Theory, vol. 51, no. 5, pp. 1817-1830, May 2005.
13. T. M. Cover and J. A. Thomas, Elements of Information Theory, second ed. New York: Wiley, 2006.
14. A. D. Wyner and J. Ziv, "A theorem on the entropy of certain binary sequences and applications: Part I," IEEE Trans. Inf. Theory, vol. IT-19, no. 6, pp. 769-772, Nov. 1973.
15. W. H. R. Equitz and T. M. Cover, "Successive refinement of information," IEEE Trans. Inf. Theory, vol. 37, no. 2, pp. 269-275, Mar. 1991.
16. E. Tuncel and K. Rose, "Additive successive refinement," IEEE Trans. Inf. Theory, vol. 49, no. 8, pp. 1983-1991, Aug. 2003.