{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:14:06Z","timestamp":1771611246592,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/itwnit.2009.5158587","type":"proceedings-article","created":{"date-parts":[[2009,7,7]],"date-time":"2009-07-07T18:19:55Z","timestamp":1246990795000},"page":"281-285","source":"Crossref","is-referenced-by-count":55,"title":["Universal weakly secure network coding"],"prefix":"10.1109","author":[{"given":"Danilo","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref10","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inform Transm"},{"key":"ref6","article-title":"On the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annual Allerton Conf on Commun Control and Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref5","first-page":"323","article-title":"Secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref12","article-title":"Universal secure network coding via rank-metric codes","author":"silva","year":"2008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557098"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","article-title":"Weakly secure network coding","author":"bhattad","year":"2005","journal-title":"Proc NetCod 2005"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"}],"event":{"name":"2009 IEEE Information Theory Workshop on Networking and Information Theory (ITW)","location":"Volos, Greece","start":{"date-parts":[[2009,6,12]]},"end":{"date-parts":[[2009,6,10]]}},"container-title":["2009 IEEE Information Theory Workshop on Networking and Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5089338\/5158522\/05158587.pdf?arnumber=5158587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T17:23:54Z","timestamp":1489771434000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5158587\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/itwnit.2009.5158587","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}