{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T08:29:42Z","timestamp":1726388982956},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009112","name":"Italian National Group for Algebraic and Geometric Structures and their Applications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009112","id-type":"DOI","asserted-by":"publisher"}]},{"name":"\u201cVALERE: Vanvitelli pEr la RicErca\u201d by the University of Campania \u201cLuigi Vanvitelli.\u201d"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1109\/tit.2020.2966974","type":"journal-article","created":{"date-parts":[[2020,1,20]],"date-time":"2020-01-20T20:55:07Z","timestamp":1579553707000},"page":"5379-5386","source":"Crossref","is-referenced-by-count":2,"title":["On the List Decodability of Rank Metric Codes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5915-8513","authenticated-orcid":false,"given":"Rocco","family":"Trombetti","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5087-2363","authenticated-orcid":false,"given":"Ferdinando","family":"Zullo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10623-012-9659-5","article-title":"Fast decoding of Gabidulin codes","volume":"66","author":"wachter-zeh","year":"2013","journal-title":"Des Codes Cryptogr"},{"key":"ref38","first-page":"433","article-title":"Fast decoding of Gabidulin codes","author":"wachter-zeh","year":"2011","journal-title":"Proc Int Workshop Coding Cryptogr"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1515\/9783110642094-013"},{"key":"ref32","first-page":"249","article-title":"Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm","author":"richter","year":"2004","journal-title":"Proc 5th Int ITG Conf Source Channel Coding"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2532343"},{"key":"ref30","first-page":"2771","article-title":"A decoding algorithm for twisted Gabidulin codes","author":"randrianarisoa","year":"2017","journal-title":"Proc Int Symp Inf Theory"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274653"},{"key":"ref36","article-title":"Decoding of block and convolutional codes in rank metric","author":"wachter-zeh","year":"2013"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2853184"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016019"},{"key":"ref10","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Probl Inf Transmiss"},{"key":"ref40","first-page":"298","article-title":"A fast linearized Euclidean algorithm for decoding Gabidulin codes","author":"wachter-zeh","year":"2010","journal-title":"Proc V Int Workshop Algebr Combin Coding Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.03.030"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.11.021"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781601980052"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2544347"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.923744"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"ref17","first-page":"1","article-title":"On decoding additive generalised twisted Gabidulin codes","author":"li","year":"2019","journal-title":"Proc Int Workshop Coding Cryptogr"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00013-016-0949-4"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2017.11.012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.02.027"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622277"},{"key":"ref3","article-title":"Partition-balanced families of codes and asymptotic enumeration in coding theory","author":"byrne","year":"2018","journal-title":"arXiv 1805 02049"},{"key":"ref6","article-title":"Maximum rank-distance codes with maximum left and right idealisers","author":"csajb\u00f3k","year":"2018","journal-title":"arXiv 1807 08774"},{"key":"ref29","article-title":"A decoding algorithm for rank metric codes","author":"randrianarisoa","year":"2017","journal-title":"arXiv 1712 07060"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.11.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.08.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034780"},{"key":"ref9","article-title":"List decoding for noisy channels","author":"elias","year":"1957"},{"key":"ref1","article-title":"A new family of maximum scattered linear sets in PG(1,q6)","author":"bartoli","year":"2019","journal-title":"arXiv 1910 02278"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2018.05.004"},{"key":"ref22","article-title":"MRD-codes arising from the trinomial xq + xq3 + cxq5Fq6[x]","author":"marino","year":"2019","journal-title":"arXiv 1907 08122"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-017-0755-5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2019.02.003"},{"key":"ref41","first-page":"91","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958"},{"key":"ref23","article-title":"Some results on linearized trinomials that split completely","author":"mcguire","year":"2019","journal-title":"arXiv 1905 11755"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0354-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359198"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9170933\/08963990.pdf?arnumber=8963990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:31:28Z","timestamp":1651080688000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8963990\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":41,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2966974","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]}}}
