Information flow decomposition for network coding
暂无分享,去创建一个
[1] Christina Fragouli,et al. Decentralized network coding , 2004, Information Theory Workshop.
[2] R. Koetter,et al. Network coding from a network flow perspective , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[3] Christina Fragouli,et al. A connection between network coding and convolutional codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).
[4] Dana Ron,et al. Bounds on Linear Codes for Network Multicast , 2003, Electron. Colloquium Comput. Complex..
[5] Peter Sanders,et al. Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.
[6] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[8] Muriel Médard,et al. Beyond routing: an algebraic approach to network coding , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[9] Anthony Ephremides,et al. Crosslayer design for distributed MAC and network coding in wireless ad hoc networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[10] Meir Feder,et al. Convolutional network codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[11] Muriel Medard,et al. On Randomized Network Coding , 2003 .
[12] R. Koetter,et al. The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[13] Christina Fragouli,et al. Network Coding as a Coloring Problem , 2004 .
[14] R. Graham,et al. Handbook of Combinatorics , 1995 .
[15] Tracey Ho,et al. A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.
[16] Christina Fragouli,et al. On Average Throughput Benefits for Network Coding , 2004 .
[17] G. Forney,et al. Minimality and observability of group systems , 1994 .
[18] Reinhard Diestel,et al. Graph Theory , 1997 .
[19] Peter Sanders,et al. Polynomial time algorithms for network information flow , 2003, SPAA '03.
[20] Christina Fragouli,et al. On Average Throughput Benefits and Alphabet Size in Network Coding , 2005 .
[21] April Rasala Lehman,et al. Complexity classification of network information flow problems , 2004, SODA '04.
[22] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[23] Shuo-Yen Robert Li,et al. Linear network coding , 2003, IEEE Trans. Inf. Theory.
[24] P. Chou,et al. Low complexity algebraic multicast network codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[25] Udi Manber,et al. Introduction to algorithms - a creative approach , 1989 .
[26] A.H. Ali,et al. On the size of arcs in projective spaces , 1995, IEEE Trans. Inf. Theory.