Combinatorial algorithms for wireless information flow

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 555-564

  Amaudruz, Aurore ^a   Fragouli, Christina ^b  

^a NOKIA RESEARCH CENTER   (United States)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; POLYNOMIAL APPROXIMATION; RELAY CONTROL SYSTEMS;

COMBINATORIAL ALGORITHM; DETERMINISTIC MODELING; EXPONENTIAL NUMBERS; LINEAR INDEPENDENCE; POLYNOMIAL-TIME ALGORITHMS; SIGNAL INTERACTIONS; UNICAST CONNECTIONS; WIRELESS RELAY NETWORKS;

INFORMATION THEORY;

EID: 70349113474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.61     Document Type: Conference Paper

References (11)

1. K. Menger, "Zur allgemeinen Kurventheorie," Fund. Math. vol.10, pp. 95-115, 1927.
2. L. R. Ford, Jr. and D. R. Fulkerson, "Maximal flow through a network," Canadian Journal of Mathematics, vol.8, pp. 399-404, 1956.
3. P Elias, A. Feinstein, and C. E. Shannon, "Note on maximum flow through a network," IRE Trans. Information Theory, vol.2, pp. 117-119, 1956.
4. S. Avestimehr, S N. Diggavi and D N C. Tse, "Wireless network information flow", Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 2007. See http://licos.epfl.ch/ index.php?p=research-projWNC
5. S. Avestimehr, S N. Diggavi and DNC. Tse, "A deterministic approach to wireless relay networks", Proceedings of Allerton Conference on Communication, Control, and Computing, Illinois, September 2007. See http://licos.epfl.ch/index.php?p=research-projWNC
6. S. Avestimehr, S N. Diggavi and D N C. Tse, "Approximate capacity of gaussian relay networks", IEEE Symposium on Information Theory (ISIT), Toronto, July 2008.
7. R. Ahlswede, N. Cai, S-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inform. Theory, vol.46, pp. 1204-1216, July 2000.
8. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain and L. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inform. Theory, vol.51, no.6, pp. 1973-1982, 2005. (Pubitemid 40843620)
9. N. Harvey, "Deterministic network coding by matrix completion," MS Thesis, MIT 2005.
10. A. Amaudruz, C. Fragouli, "Multicasting over linear deterministic networks", Allerton Conference on Communication, Control, and Computing, September 2008.
11. T. Cover and J. Thomas, "Elements of Information Theory", Wiley 2006.