{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:17:20Z","timestamp":1757312240242,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/vtcspring.2014.7022790","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T12:32:59Z","timestamp":1423139579000},"page":"1-6","source":"Crossref","is-referenced-by-count":20,"title":["A Perpetual Code for Network Coding"],"prefix":"10.1109","author":[{"given":"Janus","family":"Heide","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morten V.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank H. P.","family":"Fitzek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2009.5208076"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5963013"},{"journal-title":"Perpetual codes cache-friendly coding Unpublished draft","year":"0","author":"maymounkov","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111337"},{"key":"ref14","first-page":"129","article-title":"Decoding algorithms for random linear network codes","volume":"6827","author":"heide","year":"2011","journal-title":"IFIP International Conferences on Networking - Workshop on Network Coding Applications and Protocols (NC-Pro)"},{"journal-title":"Minimum degree reordering algorithms A tutorial","year":"0","author":"ingram","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"ref4","first-page":"87","author":"heide","year":"2011","journal-title":"Network Coding in the Real World"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2093698.2093815"},{"key":"ref6","article-title":"Methods for Efficient Network Coding","author":"maymounkov","year":"2006","journal-title":"44th Allerton Annual Conference"},{"key":"ref5","first-page":"40","article-title":"Practical network coding","volume":"4","author":"chou","year":"2003","journal-title":"Proceedings of the Annual Allerton Conference on Communication Control and Computing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2009.5191397"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2010.5487677"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","article-title":"Effects of the generation size and overlap on throughput and complexity in randomized linear network coding","author":"li","year":"2010","journal-title":"CoRR"}],"event":{"name":"2014 IEEE Vehicular Technology Conference (VTC 2014-Spring)","start":{"date-parts":[[2014,5,18]]},"location":"Seoul, South Korea","end":{"date-parts":[[2014,5,21]]}},"container-title":["2014 IEEE 79th Vehicular Technology Conference (VTC Spring)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7012013\/7022750\/07022790.pdf?arnumber=7022790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T21:13:42Z","timestamp":1490303622000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7022790\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/vtcspring.2014.7022790","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}