{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:52:04Z","timestamp":1730274724772,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/isit.2013.6620280","type":"proceedings-article","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:57:32Z","timestamp":1381546652000},"page":"519-523","source":"Crossref","is-referenced-by-count":2,"title":["Bounds on polynomial-time list decoding of rank metric codes"],"prefix":"10.1109","author":[{"given":"Antonia","family":"Wachter-Zeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9221-7"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095232"},{"journal-title":"Bounds on List Decoding of Rank Metric Codes","year":"2012","author":"wachter-zeh","key":"17"},{"journal-title":"Bounds for Projective Codes from Semidefinite Programming","year":"2012","author":"bachoc","key":"23"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809567"},{"key":"15","first-page":"329","article-title":"Bounds on list decoding gabidulin codes","author":"wachter-zeh","year":"2012","journal-title":"Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012)"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048447"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283511"},{"key":"14","article-title":"List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound","volume":"19","author":"guruswami","year":"2012","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513656"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2039163"},{"journal-title":"List Decoding of Error-Correcting Codes Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)","year":"1999","author":"guruswami","key":"3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021376"},{"key":"2","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"10","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Peredachi Inf"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480198344540"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"}],"event":{"name":"2013 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2013,7,7]]},"location":"Istanbul, Turkey","end":{"date-parts":[[2013,7,12]]}},"container-title":["2013 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6597029\/6620166\/06620280.pdf?arnumber=6620280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T03:19:49Z","timestamp":1490239189000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6620280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2013.6620280","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}