{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T07:46:53Z","timestamp":1725781613482},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/netcod.2012.6261902","type":"proceedings-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T16:06:13Z","timestamp":1345133173000},"page":"161-166","source":"Crossref","is-referenced-by-count":8,"title":["Network coding with unequal size overlapping generations"],"prefix":"10.1109","author":[{"given":"Ye","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wai-Yip","family":"Chan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven D.","family":"Blostein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503153"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095111"},{"key":"ref12","first-page":"2647","article-title":"Coding for a network coded fountain","author":"heidarzadeh","year":"2011","journal-title":"Proc IEEE Int Symp Inform Th (ISIT)"},{"key":"ref13","first-page":"364","article-title":"Analysis of random processes via and-or tree evaluation","author":"luby","year":"1998","journal-title":"Proc 9th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y"},{"key":"ref3","article-title":"A content distribution system based on sparse linear network coding","author":"ma","year":"2007","journal-title":"Proc Net Cod'07"},{"key":"ref6","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc of Allerton Conference on Communication Control and Computing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978939"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191397"},{"key":"ref7","first-page":"482","article-title":"Methods for efficient network coding","author":"maymounkov","year":"2006","journal-title":"Proc of Allerton Conference on Communication Control and Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050237"}],"event":{"name":"2012 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2012,6,29]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,6,30]]}},"container-title":["2012 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6253017\/6261874\/06261902.pdf?arnumber=6261902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:50:13Z","timestamp":1490115013000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6261902\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/netcod.2012.6261902","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}