Multicasting algorithms for deterministic networks

IEEE Information Theory Workshop 2010, ITW 2010

Volumn , Issue , 2010, Pages

  Ebrahimi, Javad ^a   Fragouli, Christina ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODING; CODE DESIGNS; CODING OPERATION; FINITE LENGTH; INTERMEDIATE NETWORKS; MULTICASTING ALGORITHMS; POLYNOMIAL-TIME ALGORITHMS; UNI-CAST ALGORITHM;

ALGORITHMS; INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

MULTICASTING;

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

References (19)

1. 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
2. S. Avestimehr, S N. Diggavi and D N C. 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
3. 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.
4. 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.
5. R. Koetter and M. Médard, "Beyond routing: an algebraic approach to network coding", IEEE/ACM Transactions on Networking, vol. 11, no. 5, pp. 782-796, October 2003.
6. 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.
7. N. Harvey, "Deterministic network coding by matrix completion," MS Thesis, MIT 2005.
8. J. T. Schwartz, "Fast probabilistic algorithms for verification of polynomial identities", Journal of the ACM, vol. 27, no. 4, pp. 701-717, 1980.
9. C. Fragouli and E. Soljanin, "Network coding: Fundamentals," Foundations and Trends in Networking, vol. 2, pp. 1-133, 2007.
10. A. Amaudruz and C. Fragouli, "Combinatorial algorithms for wireless information flow", SODA 2009.
11. J. Ebrahimi and C. Fragouli, "Combinatorial algorithms for wireless information flow", arXiv:0909.4808, under submission.
12. M. Goemans, I. Satoru and R. Zenklusen, "An algorithmic framework for wireless information flow", Allerton 2009.
13. S. Tabatabaei Yazdi and S. Savari, "A combinatorial study of linear deterministic relay networks", arXiv:0904.2401, under submission.
14. C. Shi and A. Ramamoorthy, "Fast algorithms for finding unicast capacity of linear deterministic wireless relay networks", arXiv:0909.5507v1, under submission.
15. S. Mohajer, S. Diggavi, C. Fragouli and D. Tse, 'Transmission techniques for relay-interference networks", Allerton 2008, arXiv:0812.1597.
16. S. Mohajer, S. Diggavi, C. Fragouli and D. Tse, "Capacity of deterministic Z-chain relay-interference network", in IEEE Iriformation Theory Workshop (ITW) , Volos, Greece, June 2009.
17. Istvan Kovacs, Daniel S. Silver and Susan G. Williams, "Determinants of commuting-block matrices", The American Mathematical Monthly, vol. 106, no. 10, pp. 950-952, December 1999.
18. Horn and Johnson, "Linear Algebra", Cambdrige University Press.
19. I. Chaparlinski, "On finding primitive roots in finite fields", Theoretical computer science, vol. 157, no 2, pp. 273-275, May 1996.