Matroidal undirected network

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1498-1502

  Chan, Chung ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CUT-SET BOUND; DIRECTED NETWORK; DISTRIBUTED SOURCES; GRAPHICAL MODEL; MULTIPLE NODES; OPTIMAL DIRECTION; POLYNOMIAL-TIME; SECRET KEY AGREEMENT; SOURCE-CODING; UNDIRECTED NETWORK;

COMBINATORIAL MATHEMATICS; INFORMATION THEORY; MULTICASTING; POLYNOMIAL APPROXIMATION;

TELECOMMUNICATION NETWORKS;

EID: 84867496450     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283513     Document Type: Conference Paper

References (20)

1. C. Chan, publications. http://goo.gl/4YZLT, http://chungc.net63.net/pub.
2. Z. Li and B. Li, "Network coding in undirected networks," in Proceedings of 38th Annual Conference on Information Sciences and Systems (CISS), 2004.
3. Z. Li, B. Li, and L. C. Lau, "On achieving maximum multicast throughput in undirected networks," Information Theory, IEEE Transactions on, vol. 52, no. 6, pp. 2467-2485, jun. 2006.
4. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhiuzen, "Polynomial time algorithms for multicast network code construction," Information Theory, IEEE Transactions on, vol. 51, no. 6, pp. 1973-1982, jun. 2005.
5. J. Goseling, C. Fragouli, and S. N. Diggavi, "Network coding for undirected information exchange," IEEE Communications Letters, vol. 13, no. 1, January 2009.
6. C. Chan, "Generating secret in a network," Ph.D. dissertation, Massachusetts Institute of Technology, 2010, see [1].
7. -, "The hidden flow of information," in 2011 IEEE International Symposium on Information Theory Proceedings (ISIT2011), St. Petersburg, Russia, Jul. 2011, see [1].
8. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Transactions on Information Theory, vol. 50, no. 12, Dec 2004.
9. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2002.
10. C. Y. S. Nitinawarat and A. Reznik, "Secret key generation for a pairwise independent network model," in IEEE International Symposium on Information Theory, 2008. ISIT 2008., July 2008, pp. 1015-1019.
11. C. Chan and L. Zheng, "Mutual dependence for secret key agreement," in Proceedings of 44th Annual Conference on Information Sciences and Systems, 2010, see [1].
12. A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, "Wireless network information flow: A deterministic approach," CoRR, vol. abs/cs/0906.5394, 2009.
13. A. Schrijver, "Matroids and linking systems," Journal of Combinatorial Theory, Series B, vol. 26, no. 3, pp. 349 - 369, 1979.
14. M. Goemans, S. Iwata, and R. Zenklusen, "An algorithmic framework for wireless information flow," in Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on, 30 2009-oct. 2 2009, pp. 294 -300.
15. T. S. Han, "Multicasting multiple correlated sources to multiple sinks over a noisy channel network," Information Theory, IEEE Transactions on, vol. 57, no. 1, pp. 4 -13, jan. 2011.
16. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing: Cut-set bounds," IEEE Transactions of Information Theory, vol. 57, no. 2, pp. 1015-1030, Feb 2011.
17. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" Information Theory, IEEE Transactions on, vol. 57, no. 10, pp. 6337-6350, oct. 2011.
18. C. Chan, "Multiterminal secure source coding for a common secret source," in Forty-Ninth Annual Allerton Conference on Communication, Control, and Computing, Allerton Retreat Center, Monticello, Illinois, sept 2011.
19. R. W. Yeung, Information Theory and Network Coding. Springer, 2008.
20. C. Chan, "Agreement of a restricted secret key," in 2012 IEEE International Symposium on Information Theory Proceedings (ISIT2012), Cambridge, MA, Jul. 2012, see [1].