{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:56:15Z","timestamp":1730274975560,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282933","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T22:09:52Z","timestamp":1443737392000},"page":"2633-2637","source":"Crossref","is-referenced-by-count":3,"title":["Constructing multicast networks where vector linear coding outperforms scalar linear coding"],"prefix":"10.1109","author":[{"given":"Qifu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keping","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.2307\/2690850"},{"key":"ref11","first-page":"1","article-title":"Bounds on linear codes for network multicast","author":"feder","year":"2003","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref12","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ISIT.2014.6875215"},{"year":"0","journal-title":"Great Internet Mersenne Prime Search (GIMPS) Project","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ICC.2015.7249033"},{"key":"ref4","article-title":"On linear network coding","author":"jaggi","year":"2004","journal-title":"Annual Allerton Conference"},{"key":"ref3","article-title":"On coding for non-multicast networks","author":"m\u00e9dard","year":"2003","journal-title":"Annual Allerton Conference"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/ISIT.2006.261594"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/ICC.2004.1312584"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2006.881746"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/ALLERTON.2009.5394521"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TNET.2003.818197"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/TIT.2002.807285"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2010.2094930"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282933.pdf?arnumber=7282933","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T23:33:46Z","timestamp":1490398426000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282933\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282933","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}