{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:11:58Z","timestamp":1759133518878,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523693","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"1987-1991","source":"Crossref","is-referenced-by-count":20,"title":["The encoding complexity of network coding"],"prefix":"10.1109","author":[{"given":"M.","family":"Langberg","sequence":"first","affiliation":[]},{"given":"A.","family":"Sprintson","sequence":"additional","affiliation":[]},{"given":"J.","family":"Bruck","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2004","author":"cook","key":"13"},{"journal-title":"Computers and Intractability","year":"1979","author":"garey","key":"11"},{"journal-title":"Networks Flows","year":"1993","author":"ahuja","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"journal-title":"The Encoding Complexity of Network Coding","year":"2004","author":"langberg","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"6","article-title":"Network coding as a coloring problem","author":"fragouli","year":"2004","journal-title":"Proceedings of CISS"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"9","article-title":"A unification of Monger's and Edmonds' graph theorems and aslswede et al's network coding theorem","author":"wu","year":"2004","journal-title":"Allerton Conference on Communications Control and Computing"},{"key":"8","article-title":"Bounds on linear codes for network multicast","volume":"10","author":"tavory","year":"2003","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"}],"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\/01523693.pdf?arnumber=1523693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T13:17:05Z","timestamp":1489583825000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523693","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}