{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:18:33Z","timestamp":1772893113419,"version":"3.50.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["23246071"],"award-info":[{"award-number":["23246071"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"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"}]},{"name":"Villum Foundation through the VELUX Visiting Professor Programme"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/tit.2015.2429713","type":"journal-article","created":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T18:51:47Z","timestamp":1430851907000},"page":"3912-3936","source":"Crossref","is-referenced-by-count":53,"title":["Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding"],"prefix":"10.1109","volume":"61","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4923-8824","authenticated-orcid":false,"given":"Jun","family":"Kurihara","sequence":"first","affiliation":[]},{"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Tomohiko","family":"Uyematsu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.50376"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref31","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":"ref30","first-page":"1009","article-title":"Strongly secure secret sharing scheme with ramp threshold based on Shamir’s polynomial interpolation scheme","volume":"j92 a","author":"nishiara","year":"2009","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci (Jpn Ed )"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158587"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.2026"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2009.11.006"},{"key":"ref40","volume":"1","author":"stevens","year":"1994","journal-title":"TCP\/IP Illustrated The Protocols"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref12","first-page":"1","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annu Allerton Conf Commun Control Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.340452"},{"key":"ref14","author":"fragouli","year":"2007","journal-title":"Network Coding Fundamentals"},{"key":"ref15","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmiss"},{"key":"ref16","article-title":"Properties of rank metric codes","author":"gadouleau","year":"2007"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e91-a.10.2720"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref28","author":"meyer","year":"2001","journal-title":"Matrix Analysis and Applied Linear Algebra"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2094592"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5979076"},{"key":"ref3","first-page":"413","article-title":"Valuable messages and random outputs of channels in linear network coding","author":"cai","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090197"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095233"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557284"},{"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":"0","journal-title":"Advances in Cryptology"},{"key":"ref2","first-page":"313","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"Proc AFIPS Nat Comput Conf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/632\/12622"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351183"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.2067"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483264"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.818801"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283510"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref24","article-title":"Properties of codes in rank metric","author":"loidreau","year":"2006"},{"key":"ref41","article-title":"MDS codes on the erasure-erasure wiretap channel","author":"subramanian","year":"2009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003821"},{"key":"ref26","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842763"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7122957\/07101826.pdf?arnumber=7101826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:01:48Z","timestamp":1642003308000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7101826\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":47,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2429713","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}