{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:09Z","timestamp":1763468049894,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033713","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"1151-1155","source":"Crossref","is-referenced-by-count":10,"title":["One packet suffices - Highly efficient packetized Network Coding With finite memory"],"prefix":"10.1109","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Network Coding: Beating Token Forwarding Lower Bounds in Dynamic Networks","year":"2011","author":"haeupler","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666502"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITWITWN.2007.4318066"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595268"},{"key":"ref15","first-page":"1","article-title":"Looking at Large Networks: Coding vs. Queueing","author":"bhadra","year":"2007","journal-title":"Proc of the 25th IEEE International Conference on Computer Communications (INFOCOM)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806760"},{"key":"ref17","article-title":"Optimality of Network Coding in Packetized Networks","author":"haeupler","year":"2011","journal-title":"ArXiv"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523665"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.phycom.2008.01.006"},{"key":"ref6","article-title":"Algebraic gossip: a network coding approach to optimal multiple rumor mongering","author":"deb","year":"2004","journal-title":"Proc of the 42rd Allerton Conference on Communication Control and Computing"},{"key":"ref5","first-page":"40","article-title":"Practical network coding","volume":"41","author":"chou","year":"2003","journal-title":"Proc of the 41st Allerton Conference on Communication Control and Computing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523338"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864424"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261654"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033713.pdf?arnumber=6033713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T03:14:50Z","timestamp":1490066090000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033713\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033713","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}