INTRODUCTION TO NETWORK CODING FOR ACYCLIC AND CYCLIC NETWORKS

Selected Topics in Information and Coding Theory

Volumn , Issue , 2010, Pages 339-421

  Barbero, Ángela I ^a   Ytrehus, Øyvind ^b  

^a UNIVERSITY OF VALLADOLID   (Spain)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888360664     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (63)

1. S. Acedański, S. Deb, M. Médard and R. Koetter, How Good is Random Linear Coding Based Distributed Networked Storage?, NetCod, Italy, (April 2005).
2. R. Ahlswede, N. Cai, S.-Y. R. Li and R.W. Yeung, Network information flow, IEEE Trans. Inform. Theory 46 (2000), 1204-1216.
3. R. K. Ahuja, T. L. Magnanti and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, 1993).
4. A. S. Avestimehr, S. N. Diggavi and D. N. C. Tse, A deterministic model for wireless relay networks and its capacity, Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6, July 2007), pp 6-11.
5. ´A. Barbero and Ø. Ytrehus, Cycle-logical treatment of “cyclopathic” networks, IEEE Trans. Inform. Theory 52 (2006), 2795-2805.
6. Á. Barbero and Ø. Ytrehus, Knotworking, Proc. ITA 2006, San Diego, (February 2006) (electronic publication).
7. Á. Barbero and Ø. Ytrehus, Heuristic algorithms for small field multicast encoding, Proc. ITW’06 Chengdu, (October 2006), pp 428-432.
8. Á. Barbero and Ø. Ytrehus, Facts of LIFE, Proc. 16th Int. Conf. Computer Communications and Networks, (ICCCN), Turtle Bay, Hawaii, (August 2007), pp 832-837.
9. P. Chaporkar and A. Proutiere, Adaptive network coding and scheduling for maximizing throughput in wireless networks, Proc. 13th Annual ACM Int. Conf. Mobile Computing and Networking Table of Contents, Montrïeal, Quïebec, Canada, (2007), pp 135-146.
10. st Annual Allerton Conf. Communication, Control and Computing, (October 2003).
11. T. H. Cormen, C. L. Leiserson and R. L. Rivest, Introduction to Algorithms, 2nd edn. (MIT Press, and McGraw-Hill, 2001).
12. S. Deb, M. Effros, T. Ho, D. R. Karger, R. Koetter, D. S. Lun, M. Médard and N. Ratnakar, Network coding for wireless applications: A brief tutorial, Proc. IWWAN, London, UK, (May 2005).
13. S. Deb, M. Médard and C. Choute, Algebraic gossip: A network coding approach to optimal multiple rumor mongering, IEEE Trans. Inform. Theory 52 (2006), 2486-2507.
14. R. Dougherty, C. Freiling and K. Zeger, Insufficiency of linear coding in network information flow, IEEE Trans. Inform. Theory 51 (2005), 2745-2759.
15. P. Elias, A. Feinstein and C. E. Shannon, Note on maximum flow through a network, IRE Trans. Inform. Theory IT-2 (1956), 117-119.
16. st Annual Allerton Conf. Communication Control and Computing, (October 2003).
17. E. Erez and M. Feder, Convolutional network coding, Proc. ISIT’04, Chicago, (June 2004), p. 146.
18. E. Erez and M. Feder, Convolutional network codes for cyclic networks, Proc. Netcod 2005, Italy, (April 2005).
19. L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton University Press, 1962).
20. C. Fragouli and A. Markopoulou, A network coding approach to network monitoring, Proc. 43rd Annual Allerton Conf. Communication, Control and Computing, (September 2005).
21. C. Fragouli and A. Markopoulou, Active topology inference using network coding, Proc. 44th Annual Allerton Conf. Communication, Control and Computing, (September 2006).
22. C. Fragouli and E. Soljanin, Information flow decomposition for network coding, IEEE Trans. Inform. Theory 52 (2006), 829-848.
23. C. Fragouli and E. Soljanin, Network Coding Fundamentals (Now Publishers, 2007).
24. C. Fragouli and E. Soljanin, Network Coding Applications (Now Publishers, 2008).
25. C. Fragouli, J.-Y. Le Boudec and J. Widmer, Network coding: An instant primer, ACM SIGCOMM, (2008).
26. C. Gkantsidis and P. R. Rodriguez, Network coding for large scale content distribution, IEEE Proc., INFOCOM 2005, 24th Annual Joint Conf. IEEE Computer and Communications Societies, (2005), pp 2235-2245.
27. T. Ho, R. Koetter, M. Médard, D. R. Karger and M. Effros, The benefits of coding over routing in a randomized setting, Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, (June/July 2003), p. 442.
28. T. Ho, B. Leong, R. Koetter and M. Médard, Distributed asynchronous algorithms for multicast network coding, 1st Workshop on Network Coding, WiOpt (2005).
29. T. Ho, B. Leong, Y.-H. Chang, Y. Wen and R. Koetter, Network monitoring in multicast networks using network coding, Proc. IEEE Int. Symp. Information Theory (ISIT), Adelaide, (September 2005), pp 1977-1981.
30. T. Ho and D. Lun, Network Coding - An Introduction (Cambridge University Press, 2008).
31. T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros, J. Shi and B. Leong, Toward a random operation of networks, IEEE Trans. Inform. Theory (2006), submitted for publication.
32. M. Jafarisiavoshani, C. Fragouli and S. Diggavi, On subspace properties for randomized network coding, Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6, July 2007), pp 17-21.
33. S. Jaggi, P. A. Chou and K. Jain, Low complexity algebraic multicast network codes, Proc. IEEE Int. Symp. Information Theory (ISIT), Yokohama, Japan, (June/July 2003), p. 368.
34. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain and L. M. G. M. Tolhuizen, Polynomial time algorithms for multicast network code construction, IEEE Trans. Inform. Theory 51 (2005) 1973-1982.
35. R. Koetter and M. Médard, An algebraic approach to network coding, IEEE/ACM Trans. Network 11, 5 (2003), 782-795.
36. S.-Y. R. Li, R. W. Yeung and N. Cai, Linear Network Coding, IEEE Trans. Inform. Theory 49 (2003), 371-381.
37. S.-Y. R. Li and R.W. Yeung, On convolutional network coding, Proc. ISIT’06 Seattle, (June 2006), pp 1743-1747.
38. S. Lin and D. Costello, Error Control Coding (Prentice-Hall 2004).
39. H. Francis Lu, Binary linear network codes, Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6, July 2007), pp 224-227.
40. R. Matsumoto, Construction algorithm for network error-correcting codes attaining the singleton bound, IEICE Trans. Fundam Electron. Commun. Comput. Sci. E90-A, 9 (2007), 1729-1735.
41. J. Liu, D. Goeckel and D. Towsley, Bounds on the gain of network coding and broadcasting in wireless networks, Proc. 26th IEEE Int. Conf. Computer Communications (INFOCOM), (2007), pp 724-732.
42. M. Luby, LT codes, Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, (16-19, November 2002), pp 271-280.
43. D. S. Lun, M. Médard and M. Effros, On coding for reliable communication over packet networks, Proc. 42nd Annual Allerton Conf. Communication, Control, and Computing, (September-October 2004).
44. D. S. Lun, M. Médard, T. Ho and R. Koetter, On network coding with a cost criterion, Proc. Int. Symp. Inform. Theory and its Applications (ISITA), (2004).
45. D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed and F. Zhao, Minimum-cost multicast over coded packet networks, IEEE Trans. Inform. Theory 52, 6 (2006), 2608-2623.
46. M. C. Zhou, C.-H. Wang and X. Zhao, Automating Mason’s rule and its application to analysis of stochastic Petri nets, IEEE Trans. Control Syst. Technol. 3, 2 (1995), 238-244.
47. N. Ratnakar and G. Kramer, On the separation of channel and network coding in Aref networks, Proc. IEEE Int. Symp. Information Theory (ISIT), Adelaide, (September 2005), pp 1716-1719.
48. S. Riis, Linear versus nonlinear Boolean functions in network flow, Proc. 2004 Conf. Information Sciences and Systems (CISS 2004), 2004 Conf. Information Sciences and Systems (CISS 2004), 2004.
49. K. H. Rosen (ed.), Handbook of Discrete and Combinatorial Mathematics (CRC Press, 1999).
50. Y. E. Sagduyu and A. Ephremides, Joint scheduling and wireless network coding, Proc. First Workshop on Network Coding, Riva del Garda, Italy, (April 2005).
51. P. Sanders, S. Egner and L. Tolhuizen, Polynomial time algorithms for network information flow, Proc. SPAA’03, San Diego, 7-9, (June 2003), pp 286-294.
52. A. Shokrollahi, Raptor Codes, IEEE Trans. Inform. Theory 52, 6 (2006), 2551-2567.
53. D. Silva, F. R. Kschischang and R. Koetter, A rank-metric approach to error control in random network coding, Proc. IEEE Inform. Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6, July 2007), pp 228-232.
54. L. Song, R. W. Yeung and N. Cai, A separation theorem for single-source network coding, IEEE Trans. Inform. Theory 52, 5 (2006), 1861-1871.
55. N. Thomos and P. Frossard, Raptor network video coding, Proc. Int. Workshop on Mobile Video, Augsburg, (28-28, September 2007), pp 19-24.
56. D. Traskov, N. Ratnakar, D. S. Lun, R. Koetter and M. Médard, Network coding for multiple unicasts: An approach based on linear optimization, Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, (July 2006), pp 1758-1762.
57. D. Tuninetti and C. Fragouli, On the throughput improvement due to limited complexity processing at relay nodes, Proc. IEEE Int. Symp. Information Theory (ISIT), Adelaide, (September 2005), pp 1081-1085.
58. Y. Xi and E. M. Yeh, Distributed algorithms for minimum cost multicast with network coding, Proc. 43rd Annual Allerton Conf. Communication, Control and Computing, (September 2005).
59. Y. Xi and E. M. Yeh, Distributed algorithms for minimum cost multicast with network coding in wireless networks, Proc. 4th Int. Symp. Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt ’06), Boston, MA, (April 2006).
60. S. Yang and R. W. Yeung, Refined coding bounds for network error correction, Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6 July 2007), pp 126-130.
61. R. W. Yeung, S.-Y. Robert Li, N. Cai and Z. Zhang, Network Coding Theory (World Scientific, 2006).
62. R. W. Yeung, Avalanche: A network coding analysis, Communications in Information and Systems 7, 4 (2007), 353-358.
63. Z. Zhang, X. Yan and H. Balli, Some key problems in network error correction coding theory, Proc. IEEE Information Theory Workshop on Information Theory for Wireless Networks, Bergen, (1-6, July 2007), pp 131-135.