{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:45:49Z","timestamp":1729640749088,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205280","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T15:09:52Z","timestamp":1251126592000},"page":"2863-2866","source":"Crossref","is-referenced-by-count":10,"title":["One family of algebraic codes for network coding"],"prefix":"10.1109","author":[{"given":"Martin","family":"Bossert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst M.","family":"Gabidulin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1023\/B:PRIT.0000043925.67309.c6"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034349"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"15","first-page":"1","article-title":"theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inform Transm"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9185-7"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946006020025"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557322"},{"key":"11","doi-asserted-by":"crossref","first-page":"157166","DOI":"10.1137\/0134012","article-title":"hahn polynomials, discrete harmonics, and t-designs","volume":"34","author":"delsarte","year":"1978","journal-title":"SIAM J Appl Math"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01230125"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2006.v6.n1.a3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595110"},{"key":"2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","article-title":"network error correction, i: basic concepts and upper bounds","volume":"6","author":"yeung","year":"2006","journal-title":"Communication and Information Systems"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/0131021"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.844062"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557139"},{"key":"5","article-title":"characterizations of network error correction\/ detection and erasure correction","author":"yang","year":"2007","journal-title":"Network Coding Workshop"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2006.322854"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(76)90017-0"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557321"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205280.pdf?arnumber=5205280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T23:05:37Z","timestamp":1497827137000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205280","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}