Information multicast in (pseudo-)planar networks: Efficient network coding over small finite fields

2013 International Symposium on Network Coding, NetCod 2013

Volumn , Issue , 2013, Pages

  Xiahou, Tang ^a   Li, Zongpeng ^a   Wu, Chuan ^b  

^a UNIVERSITY OF CALGARY   (Canada)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CODE ASSIGNMENTS; EFFICIENT ENCODING; FINITE FIELDS; INFORMATION FLOWS; MULTICAST DATA; NETWORK CAPACITY; PLANAR NETWORKS; UNDERLYING NETWORKS;

ELECTRIC NETWORK TOPOLOGY; MULTICASTING;

NETWORK CODING;

EID: 84883316643     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NetCod.2013.6570828     Document Type: Conference Paper

References (24)

1. R. Ahlswede, N. Cai, S. Li, and R. Yeung, "Network Information Flow, " IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. R. Koetter and M. Médard, "Beyond Routing: An Algebraic Approach to Network Coding, " in Proc. of IEEE INFOCOM, 2002.
3. Z. Li, B. Li, D. Jiang, and L. Lau, "On Achieving Optimal Throughput with Network Coding, " in Proc. of IEEE INFOCOM, 2005.
4. S. Li, R. Yeung, and N. Cai, "Linear Network Coding, " IEEE Transactions on Information Theory, vol. 49, no. 2, pp. 371-381, 2003.
5. S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen, "Polynomial Time Algorithms for Multicast Network Code Construction, " IEEE Transactions on Information Theory, vol. 51, no. 6, pp. 1973-1982, 2005.
6. M. Jafari, S. Mohajer, C. Fragouli, and S. Diggavi, "On the Capacity of Non-Coherent Network Coding, " in Proc. of IEEE International Symposium on Information Theory, 2009.
7. T. Ho, M. Médard, J. Shi, M. Effros, and D. Karger, "On Randomized Network Coding, " in Proc. of the 41st Allerton Conference, 2003.
8. J. Ebrahimi and C. Fragouli, "Properties of Network Polynomials, " in Proc. of IEEE International Symposium on Information Theory, 2012.
9. X. Yin, Y. Yang, X. Wang, X. Yang, and Z. Li, "A Graph Minor Perspective to Network Coding: Connecting Algebraic Coding with Network Topologies, " in Proc. of IEEE INFOCOM, 2013.
10. M. Lanberg and A. Sprintson, "Recent Results on the Algorithmic Complexity of Network Coding, " in Proc. of the 5th Workshop on Network Coding, Theory, and Applications, 2009.
11. R. Dougherty, C. Freiling, and K. Zeger, "Linearity and Solvability in Multicast Networks, " IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2243-2256, 2004.
12. R. Diestel, Graph Theory. Springer-Verlag, 1997.
13. S. Maheshwar, Z. Li, and B. Li, "Bounding The Coding Advantage of Combination Network Coding in Undirected Networks, " IEEE Transactions on Information Theory, vol. 58, no. 2, pp. 570-584, 2012.
14. S. Jaggi, M. Effros, T. Ho, and M. Médard, "On Linear Network Coding, " in Proc. of the 42nd Allerton Conference, 2004.
15. S. E. Rouayheb, C. Georghiades, and A. Sprintson, "Network Coding in Minimal Multicast Networks, " in Proc. of IEEE Information Theory Workshop, 2006.
16. C. Fragouli, E. Soljanin, and A. Shokrollahi, "Network Coding as a Coloring Problem, " in Proc. of the 38th Annual Conference on Information Sciences and Systems, 2004.
17. G. Dirac, "A Property of 4-Chromatic Graphs and Some Remarks on Critical Graphs, " London Mathematical Society, vol. 1, no. 1, p. 85, 1952.
18. Z. Li and B. Li, "Network Coding in Undirected Networks, " in Proc. of the 38th Annual Conference on Information Sciences and Systems, 2004.
19. P. Seymour, "Colouring Series-Parallel Graphs, " Combinatorica, vol. 10, no. 4, pp. 379-392, 1990.
20. Y. Wu, K. Jain, and S. Kung, "A Unification of Network Coding and Tree-Packing (Routing) Theorems, " IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2398-2409, 2006.
21. N. Robertson, D. Sanders, P. Seymour, and R. Thomas, "Efficiently Four-Coloring Planar Graphs, " in Proc. of the 28th ACM Symposium on Theory of Computing, 1996.
22. G. Frederickson, "On Linear-Time Algorithms for Five-Coloring Planar Graphs, " Information Processing Letters, vol. 19, no. 5, pp. 219-224, 1984.
23. D. Eppstein, "Diameter and Treewidth in Minor-Closed Graph Families, " Algorithmica, vol. 27, no. 3, pp. 275-291, 2000.
24. R. Brooks, "On Colouring the Nodes of a Network, " in Proc. of Mathematical Proceedings of the Cambridge Philosophical Society, 1941.