Minimum Number of Transmission Slots in D2D-Assisted Wireless Coded Broadcast
暂无分享,去创建一个
[1] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[2] Christina Fragouli,et al. MicroCast: cooperative video streaming on smartphones , 2012, MobiSys '12.
[3] Muriel Médard,et al. Dynamic Rate Adaptation for Improved Throughput and Delay in Wireless Network Coded Broadcast , 2012, IEEE/ACM Transactions on Networking.
[4] Parastoo Sadeghi,et al. Enabling a Tradeoff between Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems , 2014, IEEE Transactions on Communications.
[5] Shahrokh Valaee,et al. Completion Delay Minimization for Instantly Decodable Network Codes , 2012, IEEE/ACM Transactions on Networking.
[6] Panganamala Ramana Kumar,et al. RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .
[7] Ebroul Izquierdo,et al. Multi-generation packet scheduling for live streaming with network coding , 2016, 2016 Visual Communications and Image Processing (VCIP).
[8] Ebroul Izquierdo,et al. Bandwidth-Efficient Packet Scheduling for Live Streaming With Network Coding , 2016, IEEE Transactions on Multimedia.
[9] Ziv Bar-Yossef,et al. Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.
[10] Alexandros G. Dimakis,et al. Instantly decodable network codes for real-time applications , 2013, 2013 International Symposium on Network Coding (NetCod).
[11] Bo Zhang,et al. Collaborative Wireless Freeview Video Streaming With Network Coding , 2016, IEEE Transactions on Multimedia.
[12] Peter Sanders,et al. Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.
[13] Peng Wang,et al. Network Coding Based Wireless Broadcast With Performance Guarantee , 2015, IEEE Transactions on Wireless Communications.
[14] Ziv Bar-Yossef,et al. Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.
[15] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[16] Parastoo Sadeghi,et al. Instantly decodable network codes for cooperative index coding problem over general topologies , 2014, 2014 Australian Communications Theory Workshop (AusCTW).