{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:50:56Z","timestamp":1784299856932,"version":"3.55.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Minerva Post-Doctoral Fellowship"},{"name":"German Research Council through the Deutsche Forschungsgemeinschaft","award":["Bo867\/21"],"award-info":[{"award-number":["Bo867\/21"]}]},{"name":"Alexander von Humboldt Professorship Endowed"},{"name":"German Federal Ministry of Education and Research"},{"name":"German Research Council","award":["Bo867\/22"],"award-info":[{"award-number":["Bo867\/22"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tit.2015.2424930","type":"journal-article","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T18:53:09Z","timestamp":1429642389000},"page":"3199-3213","source":"Crossref","is-referenced-by-count":34,"title":["Convolutional Codes in Rank Metric With Application to Random Network Coding"],"prefix":"10.1109","volume":"61","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Stinner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283935"},{"key":"ref32","article-title":"Design aspects of woven convolutional coding","author":"jordan","year":"2002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834780"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.749009"},{"key":"ref36","article-title":"Partial unit memory codes","author":"dettmar","year":"1994"},{"key":"ref35","author":"lidl","year":"1996","journal-title":"Finite Fields (Encyclopedia of Mathematics and Its Applications)"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.243440"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TIT.1976.1055557","article-title":"Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)","volume":"22","author":"lee","year":"1976","journal-title":"IEEE Trans Inf Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056014"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-58265-7_10","article-title":"On periodic (partial) unit memory codes with maximum free distance","volume":"829","author":"zyablov","year":"0","journal-title":"Error Control Cryptology and Speech Compression"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.21238"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.259645"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1049\/el:19931351"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1049\/el:19921111"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056739"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/9780470544693"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094818"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054541"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261875"},{"key":"ref9","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.370160"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020049"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261653"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365183"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033714"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513774"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7109216\/07090997.pdf?arnumber=7090997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:47:42Z","timestamp":1642006062000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7090997\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2424930","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}