{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:29:22Z","timestamp":1764174562406,"version":"3.43.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437698","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1505-1509","source":"Crossref","is-referenced-by-count":6,"title":["On the List-Decodability of Random Linear Rank-Metric Codes"],"prefix":"10.1109","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA"}]},{"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA"}]}],"member":"263","reference":[{"journal-title":"Average-radius list-recovery of random linear codes it really ties the room together","year":"2017","author":"rudra","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1972.41.247"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213995"},{"key":"ref11","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quarterly Progress Report"},{"journal-title":"decoding for noisy channels","year":"1957","author":"elias","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"ref14","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"journal-title":"Bounds on list decoding Gabidulin codes","year":"2012","author":"wachter-zeh","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2532343"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924697"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-12929-2_11","article-title":"Designing a rank metric based Mceliece cryptosystem","author":"loidreau","year":"2010","journal-title":"Post-Quantum Cryptography (PQCrypto) - Third International Workshop"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.818023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"ref5","first-page":"3","article-title":"A new rank metric codes based encryption scheme","year":"2017","journal-title":"Proc 8th Int Workshop Post-Quantum Cryptogr (PQCrypto)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846403"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659766"},{"key":"ref22","first-page":"748","article-title":"Evading subspaces over large fields and explicit list-decodable rank-metric codes","author":"guruswami","year":"2014","journal-title":"Approximation Randomization and Combinatorial Optimization Algorithms and Techniques APPROX\/RANDOM 2014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2544347"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371915"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/120896773"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437698.pdf?arnumber=8437698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:32Z","timestamp":1754502992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437698\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437698","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}