{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:18:09Z","timestamp":1729667889525,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/netcod.2012.6261876","type":"proceedings-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T16:06:13Z","timestamp":1345133173000},"page":"7-12","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid noncoherent network coding"],"prefix":"10.1109","author":[{"given":"Vitaly","family":"Skachek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olgica","family":"Milenkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelia","family":"Nedic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039163"},{"key":"ref13","first-page":"405","article-title":"New improvements on the echelon-Ferrers construction","author":"trautmann","year":"2010","journal-title":"Proc 19th Int Symp Math Theory Netw Syst (MTNS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809567"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref3","first-page":"1","article-title":"Theory of codes with maximal rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1403004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094813"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-10868-6_1","article-title":"Subspace codes","volume":"5921","author":"khaleghi","year":"2009","journal-title":"Lecture Notes in Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021376"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"}],"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\/06261876.pdf?arnumber=6261876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:56:24Z","timestamp":1497984984000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6261876\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/netcod.2012.6261876","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}