{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:34:04Z","timestamp":1758702844425,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/netcod.2012.6261875","type":"proceedings-article","created":{"date-parts":[[2012,8,16]],"date-time":"2012-08-16T20:06:13Z","timestamp":1345147573000},"page":"1-6","source":"Crossref","is-referenced-by-count":17,"title":["Rank metric convolutional codes for Random Linear Network Coding"],"prefix":"10.1109","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.370160"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365183"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261653"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513774"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033714"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref18","article-title":"Correcting Erasures and Errors in Random Network Coding","author":"gabidulin","year":"2010","journal-title":"The 7th International Telecommunications Symposium (ITS 2010)"},{"key":"ref4","first-page":"3","article-title":"Theory of Codes with Maximum Rank Distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Peredachi Inf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref6","first-page":"1","article-title":"Multi shot Codes for Network Coding Using Rank-Metric Codes","author":"nobrega","year":"2010","journal-title":"Wireless Network Coding Conference (WiNC) 2010 IEEE"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056014"},{"key":"ref7","first-page":"349","article-title":"Short Unit-Memory Byte-Oriented Binary Convolutional Codes Having Maximal Free Distance","author":"lee","year":"1976","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034013"}],"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\/06261875.pdf?arnumber=6261875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T21:06:08Z","timestamp":1490130368000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6261875\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/netcod.2012.6261875","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}