{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:22:57Z","timestamp":1761978177274,"version":"build-2065373602"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620794","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"3090-3094","source":"Crossref","is-referenced-by-count":6,"title":["Rapprochement between instantly decodable and random linear network coding"],"prefix":"10.1109","author":[{"given":"Mingchao","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neda","family":"Aboutorab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-79711-3","author":"harris","year":"2008","journal-title":"Combinatorics and Graph Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2008.4476183"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2009.5208076"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2007.4298308"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"10","article-title":"Instantly decodable versus random linear network coding: A comparative framework for throughput and decoding delay performance","author":"sadeghi","year":"2012","journal-title":"IEEE Trans Inf Theory (Submitted To)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487666"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/MAHSS.2008.4660042"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006454"},{"key":"9","first-page":"1","article-title":"On minimizing broadcast completion delay for instantly decodable network coding","author":"sorour","year":"2010","journal-title":"Proc IEEE Int Conf on Commun (ICC)"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1155\/2010\/618016"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620794.pdf?arnumber=6620794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:25:00Z","timestamp":1602689100000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6620794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620794","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}