{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:12:09Z","timestamp":1773231129252,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1109\/tit.2010.2090212","type":"journal-article","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T20:15:42Z","timestamp":1295640942000},"page":"1124-1135","source":"Crossref","is-referenced-by-count":132,"title":["Universal Secure Network Coding via Rank-Metric Codes"],"prefix":"10.1109","volume":"57","author":[{"given":"Danilo","family":"Silva","sequence":"first","affiliation":[]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513521"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928284"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557322"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313056"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191401"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487669"},{"key":"ref17","first-page":"40","article-title":"practical network coding","author":"chou","year":"2003","journal-title":"Proc Allerton Conf on Commun Contr Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"ref4","first-page":"323","article-title":"secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref28","author":"gao","year":"1993","journal-title":"Normal Bases over Finite Fields"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.071205"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref5","article-title":"on the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Ann Allerton Conf on Commun Contr Comput"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0309"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","first-page":"1","article-title":"theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transm"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref20","author":"silva","year":"2009","journal-title":"Error Control for Network Coding"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.720537"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513776"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1561\/0100000036","article-title":"information theoretic security","volume":"5","author":"liang","year":"2009","journal-title":"Found Trends in Commun Inf Theory"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205583"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205272"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5695090\/05695127.pdf?arnumber=5695127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:01Z","timestamp":1633909621000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5695127\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2010.2090212","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}