{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T12:46:02Z","timestamp":1730292362608,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T00:00:00Z","timestamp":1635120000000},"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":[[2021,10,25]]},"DOI":"10.1109\/redundancy52534.2021.9606451","type":"proceedings-article","created":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T20:32:50Z","timestamp":1636662770000},"page":"125-130","source":"Crossref","is-referenced-by-count":4,"title":["New Communication Models and Decoding of Maximum Rank Distance Codes"],"prefix":"10.1109","author":[{"given":"Wrya K.","family":"Kadir","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2019.02.003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.11.009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.06.030"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.556603"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"ref36","article-title":"An evolution of gpt cryptosystem","author":"loidreau","year":"2016","journal-title":"Int Workshop Alg Combin Coding Theory (ACCT)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007034"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162173"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1515\/9783110642094-013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365435"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref15","volume":"abs 1712 7060","author":"randrianarisoa","year":"2017","journal-title":"A decoding algorithm for rank metric codes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/B:PRIT.0000043925.67309.c6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.012"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44223-1_1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73149-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref27","article-title":"On decoding additive generalized twisted Gabidulin codes","author":"li","year":"2019","journal-title":"International Workshop on Coding and Cryptography (WCC2003)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2018.05.004"},{"journal-title":"Linear Groups with an Exposition of the Galois Field Theory - Scholar’s Choice Edition","year":"2015","author":"dickson","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2853184"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622277"},{"key":"ref2","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12281"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518115"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849472"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-020-00449-9"},{"key":"ref24","article-title":"Decoding a class of maximum hermitian rank metric codes","author":"kadir","year":"2021","journal-title":"The 6th International Workshop on Boolean Functions and their Applications (BFA)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517980"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0407-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.12.003"}],"event":{"name":"2021 XVII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)","start":{"date-parts":[[2021,10,25]]},"location":"Moscow, Russian Federation","end":{"date-parts":[[2021,10,29]]}},"container-title":["2021 XVII International Symposium \"Problems of Redundancy in Information and Control Systems\" (REDUNDANCY)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9606438\/9606439\/09606451.pdf?arnumber=9606451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:51:44Z","timestamp":1652201504000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9606451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,25]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/redundancy52534.2021.9606451","relation":{},"subject":[],"published":{"date-parts":[[2021,10,25]]}}}