{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:29:49Z","timestamp":1762522189682,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["P2NEP2_168527"],"award-info":[{"award-number":["P2NEP2_168527"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tit.2018.2865936","type":"journal-article","created":{"date-parts":[[2018,8,24]],"date-time":"2018-08-24T20:09:48Z","timestamp":1535141388000},"page":"198-219","source":"Crossref","is-referenced-by-count":14,"title":["Adversarial Network Coding"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5901-9484","authenticated-orcid":false,"given":"Alberto","family":"Ravagnani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4274-1785","authenticated-orcid":false,"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Inform"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-380918-6.00001-9"},{"journal-title":"Fundamentals of Error-Correcting Codes","year":"2010","author":"huffman","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0077-3"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4594970"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2314642"},{"key":"ref12","first-page":"1","article-title":"Constricting the adversary: A broadcast transformation for network coding","author":"wang","year":"2007","journal-title":"Proc 45th Annu Allerton Conf Commun Control Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032817"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523584"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921894"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205602"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2701804"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970029"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557139"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01504345"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909139"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref29"},{"key":"ref5","first-page":"1","article-title":"Characterizations of network error correction\/detection and erasure correction","author":"yang","year":"2007","journal-title":"Proc Workshop Network Coding Theory Appl"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.9.1729"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1290"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","article-title":"Network error correction, I: Basic concepts and upper bounds","volume":"6","author":"yeung","year":"2006","journal-title":"Commun Inf Syst"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921711"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2006.v6.n1.a3"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595100"},{"key":"ref22","first-page":"21","article-title":"Code construction for multiple sources network coding","author":"siavoshani","year":"2009","journal-title":"Proc 10th ACM Int Symp Mobile Ad Hoc Netw Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158556"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095130"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.720537"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8581519\/08445604.pdf?arnumber=8445604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:44:41Z","timestamp":1657745081000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8445604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":35,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2865936","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}