Cost Advantage of Network Coding in Space for Irregular (5 + 1) Model
暂无分享,去创建一个
[1] Zongpeng Li,et al. A geometric framework for investigating the multiple unicast network coding conjecture , 2012, 2012 International Symposium on Network Coding (NetCod).
[2] Christina Fragouli,et al. Network Coding Fundamentals , 2007, Found. Trends Netw..
[3] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[4] Zongpeng Li,et al. Bounding the Coding Advantage of Combination Network Coding in Undirected Networks , 2012, IEEE Transactions on Information Theory.
[5] Xu Du,et al. On Space Information Flow: Single multicast , 2013, 2013 International Symposium on Network Coding (NetCod).
[6] Martin Zachariasen,et al. Euclidean Steiner minimum trees: An improved exact algorithm , 1997, Networks.
[7] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[8] Rudolf Ahlswede,et al. Network information flow , 2000, IEEE Trans. Inf. Theory.
[9] Xiaoxi Zhang,et al. Superiority of network coding in space for irregular polygons , 2012, 2012 IEEE 14th International Conference on Communication Technology.
[10] Xin Wang,et al. Min-cost multicast networks in Euclidean space , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[11] Zongpeng Li,et al. Space information flow: Multiple unicast , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.