{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:44:51Z","timestamp":1772829891993,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"The Danish Council for Independent Research","award":["DFF-4002-00367"],"award-info":[{"award-number":["DFF-4002-00367"]}]},{"name":"The Danish Council for Independent Research","award":["DFF-5137-00076B (EliteForsk-Rejsestipendium)"],"award-info":[{"award-number":["DFF-5137-00076B (EliteForsk-Rejsestipendium)"]}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26289116"],"award-info":[{"award-number":["26289116"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/tit.2017.2766292","type":"journal-article","created":{"date-parts":[[2017,10,25]],"date-time":"2017-10-25T19:39:48Z","timestamp":1508960388000},"page":"2529-2549","source":"Crossref","is-referenced-by-count":19,"title":["Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks"],"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5085-8879","authenticated-orcid":false,"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref32","first-page":"406","article-title":"On the existence of generalized rank weights","author":"oggier","year":"2012","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095233"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359198"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0077-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2015.10.009"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02038756"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371915"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/632\/12622"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2009.11.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref15","first-page":"63","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.340452"},{"key":"ref17","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2010.01.002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570238"},{"key":"ref4","first-page":"313","article-title":"Safeguarding cryptographic keys","author":"blakley","year":"1979","journal-title":"Proceedings of 3rd International Workshop on Managing Requirements Knowledge"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1959-008-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819322"},{"key":"ref6","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852315"},{"key":"ref5","first-page":"119","article-title":"Network coding and error correction","author":"cai","year":"2002","journal-title":"Proc IEEE Inform Theory Workshop"},{"key":"ref8","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref7","first-page":"291","article-title":"Secure computation from random error correcting codes","volume":"4515","author":"chen","year":"2007","journal-title":"Adv Cryptology"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620278"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2544347"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351183"},{"key":"ref22","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":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429713"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.50376"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842763"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8318403\/08082566.pdf?arnumber=8082566","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:30Z","timestamp":1633921230000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8082566\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2766292","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4]]}}}