Network coding: Does the model need tuning?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 499-504

  Lehman, April Rasala ^a   Lehman, Eric ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR CODES; MULTICAST NETWORKS; NETWORK CODING; NETWORK INFORMATION THEORY;

COMPUTATIONAL COMPLEXITY; DECODING; FUNCTIONS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; THEOREM PROVING; VECTORS;

ENCODING (SYMBOLS);

EID: 20744443003     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Rudolf Ahlswede, Ning Cai, Shuo-Yen Robert Li, and Raymond W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
2. Yu. D. Burago and V. A. Zalgaller. Geometric inequalities. In Grundlehren der mathematischen Wiseenchaften. Spinger-Verlag, 1988. Number 285.
3. Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 2001.
4. R. Dougherty, C. Freiling, and K. Zeger. Linearity and solvability in multicast networks, December 2003.
5. R. Dougherty, C. Freiling, and K. Zeger. Insufficiency of linear coding in network information flow, Febuary 2004.
6. G.H. Hardy and E.M. Wright. An Introduction to the Theory of Numbers, 5th Edition. Clarendon Press, Oxford, England, 1979.
7. Sidharth Jaggi, Peter Sanders, Philip A. Chou, Michelle Effros, Sebastian Egner, Kamal Jain, and Ludo Tolhuizen. Polynomial time algorithms for multicast network code construction, July 2003. Submitted to IEEE Transactions on Information Theory.
8. Ralf Koetter and Muriel Medard. Beyond routing: An algebraic approach to network coding. In INFOCOM, 2002.
9. Ralf Koetter and Muriel Medard. An algebraic approach to network coding. IEEE/ACM Transactions on Networking, October 2003.
10. April Rasala Lehman and Eric Lehman. Complexity classification of network information flow problems. In 14th Annual Symposium on Discrete Algorithms, January 2004.
11. Shuo-Yen Robert Li, Raymond Yeung, and Nig Cai. Linear network coding. IEEE Transactions on Information Theory, 49:371 - 381, 2003.
12. L. H. Loomis and H. Whitney. An inequality related to the isoperimetric inequality. Bulletin of the American Mathematial Society, 1949.
13. D. Ron M. Feder and A. Tavory. Bounds on linear codes for network multicast. Electronic Colloquim on Computational Complexity (ECCC), 10(033), 2003.
14. Muriel Medard, Michelle Effros, Tracy Ho, and David Karger. On coding for non-multicast networks. In 41st Annual Allerton Conference on Communication Control and Computing, 2003.
15. Soren Riis. Linear versus non-linear boolean functions in network flow. In Conference on Information Sciences and Systems (CISS), March 2003.
16. Alexandre Tiskin. A generalization of the Cauchy and Loomis-Whitney inequalities. http://www.dcs.warwick.ac.uk/ tiskin/pub/.
17. Vorlesungen über Inhalt. Oberfläche and isoperimetrie. In Grundlehren der mathematischen Wissenchaften. Springer-Verlag, 1957. Number 93.