{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:29:22Z","timestamp":1725506962217},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523613","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"1593-1597","source":"Crossref","is-referenced-by-count":8,"title":["On average throughput and alphabet size in network coding"],"prefix":"10.1109","author":[{"given":"C.","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"C.","family":"Fragouli","sequence":"additional","affiliation":[]},{"given":"E.","family":"Soljanin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"7","article-title":"On average throughput benefits for network coding","author":"fragouli","year":"2004","journal-title":"Proc 42nd Annual Allerton Conference"},{"key":"6","article-title":"Integrality ratio for group steiner trees and directed steiner trees","author":"halperin","year":"2003","journal-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06)"},{"key":"5","first-page":"59","article-title":"On directed steiner trees","author":"zosin","year":"2002","journal-title":"Proc 13th Annual ACM\/SIAM Symposium on Discrete Algorithms (SODA '02)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405308"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523613"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523613.pdf?arnumber=1523613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:47:49Z","timestamp":1489538869000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523613","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}