{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:59:37Z","timestamp":1763791177050,"version":"3.45.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,29]]},"DOI":"10.1109\/itw62417.2025.11240324","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:40Z","timestamp":1763750380000},"page":"596-601","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Construction of MRD Codes Based on Circular-Shift Operations"],"prefix":"10.1109","author":[{"given":"Zhe","family":"Zhai","sequence":"first","affiliation":[{"name":"University of Science and Technology Beijing,Department of Communication Engineering,Beijing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Jin","sequence":"additional","affiliation":[{"name":"University of Science and Technology Beijing,Department of Communication Engineering,Beijing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qifu Tyler","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Science and Technology Beijing,Department of Communication Engineering,Beijing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University,Institute for Network Sciences and Cyberspace,Beijing,P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"issue":"3","key":"ref2","first-page":"17","article-title":"Public-key cryptosystems based on linear codes","volume":"16","author":"Gabidulin","year":"1995","journal-title":"Codes and Cyphers"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2012.6483348"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"issue":"1","key":"ref6","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2018.05.004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622277"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2017042"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.12.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0108-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.02.027"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0077-3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2832624"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2890260"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3622163"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3001133"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.9772"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00350-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831861"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179842"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref26","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","volume-title":"The 3rd USENIX Conference on File and Storage Technologies","author":"Corbett"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3300919"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3383849"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2025.3541085"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553670"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511525926"}],"event":{"name":"2025 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2025,9,29]]},"location":"Sydney, Australia","end":{"date-parts":[[2025,10,3]]}},"container-title":["2025 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11240243\/11240249\/11240324.pdf?arnumber=11240324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:54:56Z","timestamp":1763790896000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11240324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw62417.2025.11240324","relation":{},"subject":[],"published":{"date-parts":[[2025,9,29]]}}}