{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T05:59:43Z","timestamp":1725429583393},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/netcod.2015.7176792","type":"proceedings-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T22:50:40Z","timestamp":1439419840000},"page":"71-75","source":"Crossref","is-referenced-by-count":1,"title":["On base field of linear network coding"],"prefix":"10.1109","author":[{"given":"Qifu","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo-Yen Robert","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2012.6181794"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875215"},{"key":"ref12","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094930"},{"journal-title":"Great Internet Mersenne Prime Search (GIMPS) Project","year":"0","key":"ref14"},{"key":"ref4","first-page":"1","article-title":"Bounds on linear codes for network multicast","author":"feder","year":"2003","journal-title":"Electronic Colloquium on Computational Complexity (ECCC) Rep 33"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228458"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref5","article-title":"Complexity classification of network information flow problems","author":"rasala","year":"2004","journal-title":"Proc of the 14th Annual ACM Symposium on Discrete Algorithms (SODA)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"ref7","article-title":"Deterministic network coding by matrix completion","author":"harvey","year":"2005","journal-title":"ACM-SIAM Sympos Discrete Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008135"}],"event":{"name":"2015 International Symposium on Network Coding (NetCod)","start":{"date-parts":[[2015,6,22]]},"location":"Sydney, Australia","end":{"date-parts":[[2015,6,24]]}},"container-title":["2015 International Symposium on Network Coding (NetCod)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172790\/7176630\/07176792.pdf?arnumber=7176792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T17:32:37Z","timestamp":1498239157000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7176792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/netcod.2015.7176792","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}