{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:05:28Z","timestamp":1730207128828,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/cig.2010.5592788","type":"proceedings-article","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T16:05:07Z","timestamp":1285949107000},"page":"1-4","source":"Crossref","is-referenced-by-count":25,"title":["Orbit codes — A new concept in the area of network coding"],"prefix":"10.1109","author":[{"given":"Anna-Lena","family":"Trautmann","sequence":"first","affiliation":[]},{"given":"Felice","family":"Manganiello","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref3","first-page":"31","article-title":"Construction of large constant dimension codes with a prescribed minimum distance","volume":"5393","author":"kohnert","year":"2008","journal-title":"MMICS"},{"key":"ref6","first-page":"405","article-title":"New improvements on the echelonferrers construction","author":"trautmann","year":"2010","journal-title":"Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems-MTNS"},{"key":"ref5","article-title":"Recursive code construction for random networks","author":"skachek","year":"2008","journal-title":"arXiv 0806 3650"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595111"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595113"},{"key":"ref2","first-page":"2909","article-title":"Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams, Information Theory","volume":"55","author":"etzion","year":"2009","journal-title":"IEEE Transactions on"},{"key":"ref9","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"m gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"}],"event":{"name":"2010 IEEE Information Theory Workshop (ITW 2010)","start":{"date-parts":[[2010,8,30]]},"location":"Dublin, Ireland","end":{"date-parts":[[2010,9,3]]}},"container-title":["2010 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5581172\/5592637\/05592788.pdf?arnumber=5592788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:32:05Z","timestamp":1490052725000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5592788\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/cig.2010.5592788","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}