{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:52:36Z","timestamp":1775868756410,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T00:00:00Z","timestamp":1447718400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Australian Research Council Discovery Projects","award":["DP 120100160"],"award-info":[{"award-number":["DP 120100160"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13634-015-0279-x","type":"journal-article","created":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T07:26:49Z","timestamp":1447745209000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"],"prefix":"10.1186","volume":"2015","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3762-5667","authenticated-orcid":false,"given":"Mingchao","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neda","family":"Aboutorab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,17]]},"reference":[{"key":"279_CR1","doi-asserted-by":"crossref","unstructured":"JK Sundararajan, D Shah, M M\u00e9dard, in Proc. IEEE Int. Symp. Information Theory (ISIT). ARQ for network coding, (2008).","DOI":"10.1109\/ISIT.2008.4595268"},{"key":"279_CR2","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"R Ahlswede, N Cai, S Li, R Yeung, Network information flow. IEEE Trans. Inf. Theory. 46, 1204\u20131216 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"279_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TNET.2008.923722","volume":"16","author":"S Katti","year":"2008","unstructured":"S Katti, H Rahul, W Hu, D Katabi, M M\u00e9dard, J Crowcroft, XORs in the air: practical wireless network coding. IEEE\/ACM Trans. Netw. 16(3), 497\u2013510 (2008).","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"279_CR4","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1109\/TNET.2007.901080","volume":"16","author":"C Fragouli","year":"2008","unstructured":"C Fragouli, J Widmer, J Le Boudec, Efficient broadcasting using network coding. IEEE\/ACM Trans. Netw. 16(2), 450\u2013463 (2008).","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"279_CR5","doi-asserted-by":"crossref","unstructured":"L Keller, E Drinea, C Fragouli, in Proc.IEEE 4th Workshop on Network Coding, Theory, and Applications (NetCod). Online broadcasting with network coding, (2008).","DOI":"10.1109\/NETCOD.2008.4476183"},{"issue":"12","key":"279_CR6","doi-asserted-by":"publisher","first-page":"5511","DOI":"10.1109\/TIT.2008.2006454","volume":"54","author":"A Eryilmaz","year":"2008","unstructured":"A Eryilmaz, A Ozdaglar, M M\u00e9dard, Ahmed E, On the delay and throughput gains of coding in unreliable networks. IEEE Trans. Inf. Theory. 54(12), 5511\u20135524 (2008).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"279_CR7","doi-asserted-by":"crossref","unstructured":"T Tran, T Nguyen, B Bose, in Proc. IEEE 4th Workshop on Network Coding, Theory, and Applications (NetCod). A joint network-channel coding technique for single-hop wireless networks, (2008).","DOI":"10.1109\/NETCOD.2008.4476175"},{"issue":"2","key":"279_CR8","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/TVT.2008.927729","volume":"58","author":"D Nguyen","year":"2009","unstructured":"D Nguyen, T Tran, T Nguyen, B Bose, Wireless broadcast using network coding. IEEE Trans. Veh. Technol. 58(2), 914\u2013925 (2009).","journal-title":"IEEE Trans. Veh. Technol."},{"key":"279_CR9","unstructured":"DE Lucani, M M\u00e9dard, M Stojanovic, in Proc. IEEE 4th Workshop on Network Coding, Theory, and Applications (NetCod). Broadcasting in time-division duplexing: a random linear network coding approach, (2009), pp. 62\u201367."},{"key":"279_CR10","doi-asserted-by":"crossref","unstructured":"DE Lucani, M M\u00e9dard, in Proc. IEEE Global Telecommun. Conf. (GLOBECOM). Random linear network coding for time-division duplexing: field size considerations, (2009).","DOI":"10.1109\/ISIT.2009.5205888"},{"key":"279_CR11","doi-asserted-by":"crossref","unstructured":"J Heide, MV Pedersen, FHP Fitzek, T Larsen, in Proc. IEEE Int. Conf. Communications (ICC) workshop. Network coding for mobile devices\u2014systematic binary random rateless codes, (2009).","DOI":"10.1109\/ICCW.2009.5208076"},{"key":"279_CR12","doi-asserted-by":"crossref","unstructured":"S Sorour, S Valaee, in Proc. IEEE Global Telecommun. Conf. (GLOBECOM). Minimum broadcast decoding delay for generalized instantly decodable network coding, (2010).","DOI":"10.1109\/ICC.2010.5502758"},{"key":"279_CR13","unstructured":"E Rozner, AP Iyer, Y Mehta, L Qiu, M Jafry, in Proc. ACM Int. Conf. Emerging Networking Experiments and Technologies (CoNEXT). ER: Efficient retransmission scheme for wireless LANs, (2007)."},{"key":"279_CR14","unstructured":"P Sadeghi, D Traskov, R Koetter, in Proc. IEEE 5th Workshop on Network Coding, Theory, and Applications (NetCod). Adaptive network coding for broadcast channels, (2009), pp. 80\u201385."},{"key":"279_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2010\/618016","volume":"2010","author":"P Sadeghi","year":"2010","unstructured":"P Sadeghi, R Shams, D Traskov, An optimal adaptive network coding scheme for minimizing decoding delay in broadcast erasure channels. EURASIP J. Wireless Commun. Netw. 2010, 1\u201314 (2010).","journal-title":"EURASIP J. Wireless Commun. Netw"},{"key":"279_CR16","unstructured":"P Sadeghi, M Yu, N Aboutorab, in Proc. IEEE Int. Symp. Information Theory and its Applications (ISITA). On throughput-delay tradeoff of network coding for wireless communications, (2014), pp. 689\u2013693."},{"issue":"11","key":"279_CR17","doi-asserted-by":"publisher","first-page":"3943","DOI":"10.1109\/TCOMM.2014.2364198","volume":"62","author":"M Yu","year":"2014","unstructured":"M Yu, P Sadeghi, N Aboutorab, From instantly decodable to random linear network coding. IEEE Trans Commun. 62(11), 3943\u20133955 (2014).","journal-title":"IEEE Trans Commun."},{"issue":"10","key":"279_CR18","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"T Ho, M M\u00e9dard, R Koetter, D Karger, M Effros, J Shi, B Leong, A random linear network coding approach to multicast. IEEE Trans. Inf. Theory. 52(10), 4413\u20134430 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"279_CR19","unstructured":"J Barros, RA Costa, D Munaretto, J Widmer, in Proc. IEEE Conf. Comput. Commun. (INFOCOM). Effective delay control in online network coding, (2009), pp. 208\u2013216."},{"issue":"5","key":"279_CR20","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/JSAC.2011.110519","volume":"29","author":"X Li","year":"2011","unstructured":"X Li, C-C Wang, Lin X, On the capacity of immediately-decodable coding schemes for wireless stored-video broadcast with hard deadline constraints. IEEE J. Sel. Areas Commun. 29(5), 1094\u20131105 (2011).","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"279_CR21","unstructured":"L Yang, YE Sagduyu, JH Li, in Proc. ACM Int. Symp. Mobile Ad Hoc Networking and Computing (MobiHoc). Adaptive network coding for scheduling real-time traffic with hard deadlines, (2012), pp. 105\u2013114."},{"key":"279_CR22","doi-asserted-by":"crossref","unstructured":"SY El Rouayheb, MAR Chaudhry, A Sprintson, in Proc. IEEE Information Theory Workshop (ITW). On the minimum number of transmissions in single-hop wireless coding networks, (2007).","DOI":"10.1109\/ITW.2007.4313060"},{"key":"279_CR23","doi-asserted-by":"crossref","unstructured":"S Sorour, S Valaee, in Proc. IEEE. Int. Conf. Communications (ICC). On minimizing broadcast completion delay for instantly decodable network coding, (2010).","DOI":"10.1109\/ICC.2010.5502758"},{"issue":"12","key":"279_CR24","doi-asserted-by":"publisher","first-page":"5077","DOI":"10.1109\/TCOMM.2013.102313.110741","volume":"61","author":"S Sorour","year":"2013","unstructured":"S Sorour, S Valaee, Coding opportunity densification strategies for instantly decodable network coding. IEEE Trans. Commun. 61(12), 5077\u20135089 (2013).","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"279_CR25","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1109\/TCOMM.2014.021614.130172","volume":"62","author":"N Aboutorab","year":"2014","unstructured":"N Aboutorab, P Sadeghi, S Sorour, Enabling a tradeoff between completion time and decoding delay in instantly decodable network coded systems. IEEE Trans. Commun. 62(4), 1269\u20131309 (2014).","journal-title":"IEEE Trans. Commun."},{"key":"279_CR26","unstructured":"N Aboutorab, P Sadeghi, SE Tajbakhsh, in Proc. IEEE Int. Symp. Information Theory (ISIT). Instantly decodable network coding for delay reduction in cooperative data exchange systems, (2013), pp. 3095\u20133099."},{"key":"279_CR27","unstructured":"MS Karim, N Aboutorab, AA Nasir, P Sadeghi, in Proc. IEEE Information Theory Workshop (ITW). Decoding delay reduction in network coded cooperative systems with intermittent status update, (2014), pp. 391\u2013395."},{"key":"279_CR28","unstructured":"Y Keshtkarjahromi, H Seferoglu, R Ansari, A Khokhar, in Proc IEEE Int. Conf. Computing, Networking and Communications (ICNC). Content-aware instantly decodable network coding over wireless networks, (2015), pp. 803\u2013809."},{"key":"279_CR29","unstructured":"S Sorour, S Valaee, in Proc. IEEE Int. Symp. Personal Indoor and Mobile Radio Communications (PIMRC). Completion delay reduction in lossy feedback scenarios for instantly decodable network coding, (2011), pp. 2025\u20132029."},{"key":"279_CR30","doi-asserted-by":"crossref","unstructured":"S Sorour, S Valaee, in Proc. IEEE ICC. Completion delay minimization for instantly decodable network coding with limited feedback, (2011).","DOI":"10.1109\/icc.2011.5963123"},{"key":"279_CR31","doi-asserted-by":"crossref","unstructured":"A Le, AS Tehrani, AG Dimakis, A Markopoulou, in Proc. IEEE Int. Symp. Network Coding (NetCod). Instantly decodable network codes for real-time applications, (2013).","DOI":"10.1109\/NetCod.2013.6570827"},{"key":"279_CR32","unstructured":"N Aboutorab, S Sorour, P Sadeghi, in Proc. IEEE Int. Symp. Network Coding (NetCod). O2-gidnc: Beyond instantly decodable network coding, (2013), pp. 1\u20136."},{"key":"279_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-79711-3","volume-title":"Combinatorics and Graph Theory","author":"JM Harris","year":"2008","unstructured":"JM Harris, JL Hirst, MJ Mossinghoff, Combinatorics and Graph Theory, 2nd Edition (Springer Press, Verlag New York, 2008)."},{"key":"279_CR34","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/352","volume-title":"Graph Coloring, ser. Contemporary Mathematics","author":"M Kubale","year":"2004","unstructured":"M Kubale, Graph Coloring, ser. Contemporary Mathematics (American Mathematical Society, Providence, Rhode Island, 2004)."},{"key":"279_CR35","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/2316874","volume":"77","author":"WA Vasconcelos","year":"1970","unstructured":"WA Vasconcelos, CW Avery, WAJ Luxemburg, RE Shafer, D Marcus, DP Gelle, Advanced Problems: 5707-5713. American Mathematical Monthly. 77, 84\u201385 (1970).","journal-title":"American Mathematical Monthly"},{"key":"279_CR36","doi-asserted-by":"crossref","unstructured":"W Xiao, D Starobinski, in Proc. IEEE Conf. Comput. Commun. (INFOCOM). Extreme value FEC for reliable broadcasting in wireless networks, (2009).","DOI":"10.1109\/INFCOM.2009.5062112"},{"key":"279_CR37","doi-asserted-by":"crossref","unstructured":"M Ghaderi, D Towsley, J Kurose, in Proc. IEEE Conf. Comput. Commun. (INFOCOM). Reliability gain of network coding in lossy wireless networks, (2008).","DOI":"10.1109\/INFOCOM.2007.284"},{"issue":"10","key":"279_CR38","doi-asserted-by":"publisher","first-page":"6328","DOI":"10.1109\/TIT.2013.2271895","volume":"59","author":"B Swapna","year":"2013","unstructured":"B Swapna, A Eryilmaz, NB Shroff, Throughput-delay analysis of random linear network coding for wireless broadcasting. IEEE Trans Inf. Theory. 59(10), 6328\u20136341 (2013).","journal-title":"IEEE Trans Inf. Theory"},{"key":"279_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Ballob\u00e1s","year":"2001","unstructured":"B Ballob\u00e1s, Random Graphs (Cambridge University Press, Cambridge, UK, 2001)."},{"issue":"1","key":"279_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02122551","volume":"8","author":"B Bollob\u00e1s","year":"1988","unstructured":"B Bollob\u00e1s, The chromatic number of random graphs. Combinatorica. 8(1), 49\u201355 (1988).","journal-title":"Combinatorica"},{"key":"279_CR41","unstructured":"R Costa, D Munaretto, J Widmer, J Barros, in Proc. IEEE Int. Conf. Mobile Ad Hoc and Sensor Syst., (MASS). Informed network coding for minimum decoding delay, (2008), pp. 80\u201391."},{"issue":"9","key":"279_CR42","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"C Bron, J Kerbosch, Algorithm 457, Finding all cliques of an undirected graph. Commun. ACM. 16(9), 575\u2013577 (1973). New York.","journal-title":"Commun. ACM"},{"key":"279_CR43","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-31833-0_21","volume-title":"Approximation and Online Algorithms","author":"G Agnarsson","year":"2005","unstructured":"G Agnarsson, MM Halld\u00f3rsson, in Approximation and Online Algorithms. Strong colorings of hypergraphs (SpringerBerlin Heidelberg, 2005), pp. 253\u2013266."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-015-0279-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0279-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-015-0279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T12:23:29Z","timestamp":1567340609000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-015-0279-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,17]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1186\/s13634-015-0279-x","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,17]]},"article-number":"94"}}