{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T06:38:28Z","timestamp":1776753508264,"version":"3.51.2"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/icc.2004.1312584","type":"proceedings-article","created":{"date-parts":[[2004,10,19]],"date-time":"2004-10-19T08:22:24Z","timestamp":1098174144000},"page":"661-666 Vol.2","source":"Crossref","is-referenced-by-count":31,"title":["A connection between network coding and convolutional codes"],"prefix":"10.1109","author":[{"given":"C.","family":"Fragouli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Soljanin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Network Coding Based on Subtree Decomposition","author":"fragouli","year":"0","journal-title":"Submitted to Transactions on Information Theory"},{"key":"ref3","article-title":"Bounds on Linear Codes for Network Multicast","author":"feder","year":"2003","journal-title":"Electronic Colloquium on Computational Complexity"},{"key":"ref10","article-title":"Achievable Capacity of Network Coding for Random Networks","author":"ramamoorthy","year":"2003","journal-title":"Globecom"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019253"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1145\/777412.777464","article-title":"Polynomial Time Algorithms For Network Information Flow","author":"sanders","year":"2003","journal-title":"Proceedings of the ACM Symposium on Parallel Algorithms and Architectures"},{"key":"ref5","article-title":"Network Coding as a Coloring Problem","author":"fragouli","year":"2004","journal-title":"invited paper CISS 2004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref7","author":"lidl","year":"1997","journal-title":"Finite Fields"},{"key":"ref2","article-title":"Graph Theory","author":"diestel","year":"2000"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90375-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"}],"event":{"name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","location":"Paris, France","start":{"date-parts":[[2004,6,24]]},"end":{"date-parts":[[2004,6,24]]}},"container-title":["2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9179\/29119\/01312584.pdf?arnumber=1312584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T16:04:11Z","timestamp":1682784251000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1312584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/icc.2004.1312584","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}