Compute-and-forward for discrete memoryless networks

2014 IEEE Information Theory Workshop, ITW 2014

Volumn , Issue , 2014, Pages 5-9

  Nazer, Bobak ^a   Gastpar, Michael ^b  

^a Boston University   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; CODE-WORDS; COMPUTE AND FORWARDS; DISCRETE MEMORYLESS MULTIPLE ACCESS CHANNEL; GAUSSIAN NETWORKS; LINEAR COMBINATIONS; MEMORYLESS; NON-TRIVIAL;

INFORMATION THEORY;

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

References (14)

1. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. IT, vol. 57, no. 10, Oct. 2011.
2. M. P.Wilson, K. Narayanan, H. Pfister, and A. Sprintson, "Joint physical layer coding and network coding for bidirectional relaying," IEEE Trans. IT, vol. 11, no. 56, Nov. 2010.
3. W. Nam, S. Chung, and Y. Lee, "Nested lattice codes for Gaussian relay networks with interference," IEEE Trans. IT, vol. 57, no. 12, Dec. 2011.
4. S. N. Hong and G. Caire, "Compute-and-forward strategies for cooperative distributed antenna systems," IEEE Trans. IT, vol. 56, no. 9, Sep. 2013.
5. O. Ordentlich, U. Erez, and B. Nazer, "The approximate sum capacity of the symmetric K-user Gaussian interference channel," IEEE Trans. IT, vol. 60, no. 6, Jun. 2014.
6. J. Zhan, B. Nazer, U. Erez, and M. Gastpar, "Integer-forcing linear receivers," IEEE Trans. IT, to appear 2014.
7. J. Zhu and M. Gastpar, "Gaussian (dirty) multiple access channels: A compute-and-forward perspective," in ISIT 2014, Honolulu, HI.
8. B. Nazer and M. Gastpar, "Computation over multiple-access channels," IEEE Trans. IT, vol. 53, no. 10, Oct. 2007.
9. A. Padakandla and S. S. Pradhan, "Computing sum of sources over an arbitrary multiple-access channel," in ISIT 2013, Istanbul, Turkey.
10. V. Ntranos, V. Cadambe, B. Nazer, and G. Caire, "Asymmetric computeand-forward," in Allerton 2013, Monticello, IL.
11. O. Ordentlich, U. Erez, and B. Nazer, "Successive integer-forcing and its sum-rate optimality," in Allerton 2013, Monticello, IL.
12. J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. IT, vol. 25, no. 2, Mar. 1979.
13. A. J. Grant, B. Rimoldi, R. Urbanke, and P. A. Whiting, "Rate-splitting multiple access for discrete memoryless channels," IEEE Trans. IT, vol. 47, no. 3, Mar. 2001.
14. A. El Gamal and Y.-H. Kim, Network Information Theory. Cambridge University Press, 2011.