{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:28:18Z","timestamp":1649161698234},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1109\/lcomm.2016.2619706","type":"journal-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T18:42:31Z","timestamp":1477075351000},"page":"448-451","source":"Crossref","is-referenced-by-count":1,"title":["Generic Linear Network Code Construction Using Transversal Matroids"],"prefix":"10.1109","volume":"21","author":[{"given":"Morteza","family":"Rekab-Eslami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Esmaeili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Aaron Gulliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"An efficient centralized binary multicast network coding algorithm for any cyclic network","author":"diez","year":"2007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.016"},{"key":"ref12","author":"oxley","year":"1992","journal-title":"Matroid Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090227"},{"key":"ref14","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555955"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2375332"},{"key":"ref6","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":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.13.131558"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s13160-016-0209-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-2.2.284"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2095490"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874542"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7874222\/07605470.pdf?arnumber=7605470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:20:19Z","timestamp":1642004419000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7605470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":15,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2016.2619706","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]}}}