{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:28:25Z","timestamp":1773761305197,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4594971","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T22:33:52Z","timestamp":1218666832000},"page":"176-180","source":"Crossref","is-referenced-by-count":46,"title":["Security for wiretap networks via rank-metric codes"],"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":"15","first-page":"1973","volume":"51","author":"jaggi","year":"2005","journal-title":"Polynomial time algorithms for multicast network code construction"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557322"},{"key":"14","author":"silva","year":"2007","journal-title":"A rankmetric approach to error control in random network coding"},{"key":"11","article-title":"error and erasure decoding of rankcodes with a modified berlekamp-massey algorithm","author":"richter","year":"2004","journal-title":"Proc ITG Conf on Source and Channel Coding"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2006.173"},{"key":"3","first-page":"782","volume":"11","author":"koetter","year":"2003","journal-title":"An algebraic approach to network coding"},{"key":"2","first-page":"371","volume":"49","author":"li","year":"2003","journal-title":"Linear network coding"},{"key":"1","first-page":"1204","volume":"46","author":"ahlswede","year":"2000","journal-title":"Network information flow"},{"key":"10","first-page":"328","volume":"37","author":"roth","year":"1991","journal-title":"Maximum-rank array codes and their application to crisscross error correction"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"6","first-page":"551","article-title":"on wiretap networks ii","author":"rouayheb","year":"2007","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"5","article-title":"on the capacity of secure network coding","author":"feldman","year":"2004","journal-title":"Proc 42nd Annual Allerton Conf on Cornmun Control and Computing"},{"key":"4","first-page":"323","article-title":"secure network coding","author":"cai","year":"2002","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"9","first-page":"1","article-title":"theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inform Transm"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39757-4_5"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","location":"Toronto, ON, Canada","start":{"date-parts":[[2008,7,6]]},"end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04594971.pdf?arnumber=4594971","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T15:43:47Z","timestamp":1489679027000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4594971\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4594971","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}