{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T19:02:38Z","timestamp":1761418958870,"version":"3.37.3"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61271174","61301178"],"award-info":[{"award-number":["61271174","61301178"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/lcomm.2014.2385079","type":"journal-article","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T14:32:44Z","timestamp":1419258764000},"page":"143-146","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Polynomial Time Algorithm for Robust Multicast Network Code Construction"],"prefix":"10.1109","volume":"19","author":[{"given":"Fang","family":"Li","sequence":"first","affiliation":[]},{"given":"Wangmei","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181794"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173720"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018173"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7033064\/06994773.pdf?arnumber=6994773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:21Z","timestamp":1641987681000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6994773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":10,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2014.2385079","relation":{},"ISSN":["1089-7798"],"issn-type":[{"type":"print","value":"1089-7798"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}