{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:17:04Z","timestamp":1725477424126},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1109\/isit.2008.4595306","type":"proceedings-article","created":{"date-parts":[[2008,8,13]],"date-time":"2008-08-13T18:33:52Z","timestamp":1218652432000},"page":"1838-1842","source":"Crossref","is-referenced-by-count":1,"title":["Linear network codes and systems of polynomial equations"],"prefix":"10.1109","author":[{"given":"Randall","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Chris","family":"Freiling","sequence":"additional","affiliation":[]},{"given":"Kenneth","family":"Zeger","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Combinatorial Geometries Encyclopedia of Mathematics and Its Applications","year":"1987","key":"19"},{"key":"17","article-title":"complexity classification of network information flow problems","author":"rasala lehman","year":"2003","journal-title":"4Ist Annual Allerton Conference on Communication Control and Computing"},{"key":"18","article-title":"linear versus non-linear boolean functions in network flow","author":"riis","year":"2004","journal-title":"38th Annual Conference on Information Sciences and Systems (CISS)"},{"key":"15","article-title":"on coding for nonmulticast networks","author":"me?dard","year":"2003","journal-title":"41st Annual Allerton Conf on Communication Control and Computing"},{"journal-title":"Matroid Theory","year":"1992","author":"oxley","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.2307\/2371070"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"journal-title":"A Modern View of Geometry","year":"1961","author":"blumenthal","key":"3"},{"key":"20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"journal-title":"Gro?bner Bases A Computational Approach to Commutative Algebra","year":"1993","author":"becker","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00134-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228458"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874405"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834751"},{"key":"9","first-page":"1","article-title":"bounds on linear codes for network multicast","author":"feder","year":"2003","journal-title":"Electronic Colloquium on Computational Complexity (ECCC) Report 33"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.883634"}],"event":{"name":"2008 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2008,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2008,7,11]]}},"container-title":["2008 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4586217\/4594928\/04595306.pdf?arnumber=4595306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T06:55:27Z","timestamp":1497768927000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4595306\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2008.4595306","relation":{},"subject":[],"published":{"date-parts":[[2008,7]]}}}