{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T11:08:29Z","timestamp":1744888109403,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033714","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T17:24:20Z","timestamp":1317921860000},"page":"1156-1160","source":"Crossref","is-referenced-by-count":8,"title":["Localized dimension growth in random network coding: A convolutional approach"],"prefix":"10.1109","author":[{"given":"Wangmei","family":"Guo","sequence":"first","affiliation":[]},{"given":"Ning","family":"Cai","sequence":"additional","affiliation":[]},{"family":"Xiaomeng Shi","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"On linear network coding","author":"jaggi","year":"2004","journal-title":"Proc of the 42nd Allerton Conference"},{"key":"ref11","first-page":"24","article-title":"The conditions to determine convolutional network coding on matrix representation","author":"cai","year":"2009","journal-title":"Proc Net Cod"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TC.1968.229392","article-title":"inverses of linear sequential circuits","volume":"c 17","author":"masseyy","year":"1968","journal-title":"IEEE Transactions on Computers"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018173"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/0100000007I"},{"key":"ref4","first-page":"21","article-title":"On coding for nonmulticast networks","volume":"41","author":"m\u00e9dard","year":"2003","journal-title":"Proc of the 41st Allerton Conference"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261653"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847712"},{"key":"ref8","first-page":"786","article-title":"A binary coding approach for combination networks and general erasure networks","author":"xiao","year":"2008","journal-title":"IEEE Int Symp on Inf Theory (ISIT)"},{"key":"ref7","first-page":"146","article-title":"Convolutional network codes","author":"erez","year":"2005","journal-title":"IEEE Int Symp on Inf Theory (ISIT)"},{"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","article-title":"On minimizing network coding resources: An evolutionary approach","author":"kim","year":"2006","journal-title":"Proc NetCod"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033714.pdf?arnumber=6033714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:35:25Z","timestamp":1497944125000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033714","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}