{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:47:11Z","timestamp":1770976031918,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5206004","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"1159-1163","source":"Crossref","is-referenced-by-count":23,"title":["An algebraic watchdog for wireless network coding"],"prefix":"10.1109","author":[{"given":"MinJi","family":"Kim","sequence":"first","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]},{"given":"Joao","family":"Barros","sequence":"additional","affiliation":[]},{"given":"Ralf","family":"Kotter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-55719-9_77","article-title":"polynomial hash functions are reliable","volume":"623","author":"dietzfelbinger","year":"1992","journal-title":"Proceedings of the 19th International Colloquium on Automata Languages and Programming"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/WMCSA.1994.33"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.850674"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/571637.571640"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"2","first-page":"255","article-title":"mitigating routing misbehavior in mobile ad hoc networks","author":"marti","year":"2000","journal-title":"Proceedings of the 6th annual international conference on Mobile computing and networking"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/501416.501437"},{"key":"10","article-title":"network layer protocols with byzantine robustness","author":"perlman","year":"1988"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.78"},{"key":"6","first-page":"19","article-title":"network error correction","author":"yeung","year":"2006","journal-title":"Communications in Information and Systems"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2008.01.006"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2008.4753089"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","location":"Seoul, South Korea","start":{"date-parts":[[2009,6,28]]},"end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05206004.pdf?arnumber=5206004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T19:05:42Z","timestamp":1497812742000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5206004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5206004","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}