{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:55Z","timestamp":1740131695201,"version":"3.37.3"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"name":"China 973 Program","award":["2012CB315905"],"award-info":[{"award-number":["2012CB315905"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61201261","61471034","61571335"],"award-info":[{"award-number":["61201261","61471034","61571335"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Peacock Scheme of Shenzhen, China","award":["KQCX20130628164008004"],"award-info":[{"award-number":["KQCX20130628164008004"]}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RT733206"],"award-info":[{"award-number":["RT733206"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/tit.2015.2473863","type":"journal-article","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T18:57:33Z","timestamp":1440701853000},"page":"6182-6191","source":"Crossref","is-referenced-by-count":20,"title":["Multicast Network Coding and Field Sizes"],"prefix":"10.1109","volume":"61","author":[{"given":"Qifu Tyler","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xunrui","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keping","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2004","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834751"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2093851"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896862"},{"journal-title":"Matroid Theory","year":"2006","author":"oxley","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"journal-title":"Great Internet Mersenne Prime Search (GIMPS) Project","year":"2015","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094930"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0049"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228458"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref5","first-page":"489","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181794"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","first-page":"1","article-title":"Bounds on linear codes for network multicast","author":"feder","year":"2003","journal-title":"Proc Electron Colloq Comput Complex (ECCC)"},{"key":"ref20","first-page":"1833","article-title":"On network matroids and linear network codes","author":"sun","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3845-2","author":"nathanson","year":"1996","journal-title":"Additive Number Theory Inverse Problems and the Geometry of Sumsets"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.13.131558"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570828"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7299738\/07226851.pdf?arnumber=7226851","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:35:47Z","timestamp":1633919747000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7226851\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":23,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2473863","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}