{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T21:53:52Z","timestamp":1776462832558,"version":"3.51.2"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Danish Council for Independent Research (EliteForsk-Rejsestipendium)","award":["DFF-4002-00367"],"award-info":[{"award-number":["DFF-4002-00367"]}]},{"name":"Danish Council for Independent Research (EliteForsk-Rejsestipendium)","award":["DFF-5137-00076B"],"award-info":[{"award-number":["DFF-5137-00076B"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1109\/tit.2017.2748148","type":"journal-article","created":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T18:25:49Z","timestamp":1504290349000},"page":"192-204","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2626-8139","authenticated-orcid":false,"given":"Umberto","family":"Martinez-Penas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3934\/amc.2017014","article-title":"On defining generalized rank weights","volume":"11","author":"jurrius","year":"2017","journal-title":"Adv Math Commun"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429713"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref15","first-page":"1959","article-title":"Generalized rank weights of reducible codes, optimal cases and related properties","author":"mart\u00ednez-pe\u00f1as","year":"2016","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570238"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852315"},{"key":"ref18","first-page":"406","article-title":"On the existence of generalized rank weights","author":"oggier","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl (ISITA)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref4","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref3","first-page":"119","article-title":"Network coding and error correction","author":"cai","year":"2002","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/632\/12622"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref8","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970809"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004226"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820038"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2015.10.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.50376"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8232491\/08024038.pdf?arnumber=8024038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:55Z","timestamp":1642004755000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8024038\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":26,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2748148","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}