{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:58Z","timestamp":1774679698377,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174497","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"54-59","source":"Crossref","is-referenced-by-count":15,"title":["Generic Decoding in the Sum-Rank Metric"],"prefix":"10.1109","author":[{"given":"Sven","family":"Puchinger","sequence":"first","affiliation":[{"name":"Technical University of Denmark (DTU),Department of Applied Mathematics and Computer Science,Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julian","family":"Renner","sequence":"additional","affiliation":[{"name":"Technical University of Munich (TUM),Institute for Communications Engineering,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan","family":"Rosenkilde","sequence":"additional","affiliation":[{"name":"Technical University of Denmark (DTU),Department of Applied Mathematics and Computer Science,Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref11","first-page":"114","article-title":"A Public-Key Cryptosystem Based On Algebraic Coding Theory","volume":"42","author":"mceliece","year":"1978","journal-title":"Deep Space Network Progress Report"},{"key":"ref12","first-page":"159","article-title":"Knapsack-Type Cryptosystems and Algebraic Coding Theory","volume":"15","author":"niederreiter","year":"1986","journal-title":"Problems of Control and Information Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616127"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"ref17","article-title":"Supporting Documentation of Submission: ”Classic McEliece\" to the NIST Post-Quantum Standardization","author":"bernstein","year":"2019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0034862"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020369320078"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2424930"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2012.6261875"},{"key":"ref6","article-title":"Faster decoding of rank metric convolutional codes","author":"napp","year":"2018","journal-title":"Inter Symposium on Mathematical Theory of Networks and Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007033"},{"key":"ref8","article-title":"An algorithm for decoding skew reed-solomon codes with respect to the skew metric","author":"boucher","year":"2019","journal-title":"Workshop on Coding and Cryptography"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2018.02.005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946011020049"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2912165"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/WINC.2010.5507933"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref22","article-title":"An algebraic attack on rank metric code-based cryptosystems","author":"bardet","year":"2019","journal-title":"Tech Rep"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"ref24","article-title":"Weight and rank of matrices over finite fields","author":"migler","year":"2004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref26","first-page":"3","article-title":"Theory of Codes with Maximum Rank Distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2140\/obs.2019.2.293"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174497.pdf?arnumber=9174497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:21Z","timestamp":1773347721000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174497\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174497","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}