Noisy network coding

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Lim, Sung Hoon ^a   Kim, Young Han ^b   El Gamal, Abbas ^c   Chung, Sae Young ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODEBOOKS; CODING SCHEME; COMPRESSION INDEX; GAUSSIAN NETWORKS; MULTIPLE SOURCE; NETWORK CODING; NEW RESULTS; RECEIVED SIGNALS; RELAY CHANNELS; RELAY NETWORK; RELAYING SCHEMES; REPETITION CODING; WIRELESS RELAY NETWORKS;

DECODING; INFORMATION THEORY; MULTICASTING; RELAY CONTROL SYSTEMS;

WIRELESS NETWORKS;

EID: 77954832759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503216     Document Type: Conference Paper

References (20)

1. R. Ahlswede, N. Cai, S.-Y R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. In! Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. L. R. Ford, Jr. and D. R. Fulkerson, "Maximal flow through a network," Canad. J. Math., vol. 8, pp. 399-404, 1956.
3. P. Elias, A. Feinstein, and C. E. Shannon, "A note on the maximum flow through a network," IRE Trans. Inf. Theory, vol. 2, no. 4, pp. 117-119, Dec. 1956.
4. A. F. Dana, R. Gowaikar, R. Palanki, B. Hassibi, and M. Effros, "Capacity of wireless erasure networks," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 789-804, 2006.
5. N. Ratnakar and G. Kramer, "The multicast capacity of deterministic relay networks with no interference," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2425-2432, 2006.
6. S. Avestimehr, S. Diggavi, and D. Tse, " Wireless network information flow: A deterministic approach," 2009, submitted to IEEE Trans. Inf. Theory, 2009. [Online]. Available: http://arxiv.org/abs/0906.5394
7. B. Smith and S. Vishwanath, "Unicast transmission over multiple access erasure networks: Capacity and duality," in Proc. Information Theory Workshop, Tahoe City, California, May 2007, pp. 331-336.
8. E. C. van der Meulen, "Three-terminal communication channels," Adv. Appl. Prob., vol. 3, pp. 120-154, 1971.
9. T. M. Cover and A. El Gamal, "Capacity theorems for the relay channel," IEEE Trans. Inf. Theory, vol. 25, no. 5, pp. 572-584, Sep. 1979.
10. A. El Gamal and M. R. Aref, "The capacity of the semideterministic relay channel," IEEE Trans. Inf. Theory, vol. 28, no. 3, p. 536, 1982.
11. 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, 2005.
12. M. R. Aref, "Information flow in relay networks," Ph.D. Thesis, Stanford University, Stanford, CA, Oct. 1980.
13. A. El Gamal, "On information flow in relay networks," in Proc. IEEE National Telecom Conference, Nov. 1981, vol. 2, pp. D4.l.l-D4.1.4.
14. L.-L. Xie and P. R. Kumar, "An achievable rate for the multiple-level relay channel," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1348-1358, 2005.
15. 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-3063, Sep. 2005.
16. Y-H. Kim, "Capacity of a class of deterministic relay channels," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 1328-1329, Mar. 2008.
17. M. Aleksic, P. Razaghi, and W. Yu, "Capacity of a class of modulo-sum relay channel," in Proc. IEEE International Symposium on Information Theory, Nice, France, June 2007, pp. 596-600.
18. A. El Gamal, M. Mohseni, and S. Zahedi, "Bounds on capacity and minimum energy-per-bit for AWGN relay channels," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1545-1561, 2006.
19. A. El Gamal and Y-H. Kim, Lecture Notes on Network Information Theory, Stanford University and UCSD, 2009.
20. S. H. Lim, Y-H. Kim, A. El Gamal, and S.-Y Chung, "Noisy network coding," 2009.