{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T20:38:15Z","timestamp":1777322295809,"version":"3.51.4"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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","award":["62271044"],"award-info":[{"award-number":["62271044"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Quan Cheng Laboratory","doi-asserted-by":"publisher","award":["QCL20250108"],"award-info":[{"award-number":["QCL20250108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tit.2026.3673346","type":"journal-article","created":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:54Z","timestamp":1773347754000},"page":"2861-2880","source":"Crossref","is-referenced-by-count":0,"title":["Construction of MRD Codes Based on Circular-Shift Operations"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5405-4157","authenticated-orcid":false,"given":"Zhe","family":"Zhai","sequence":"first","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5478-8151","authenticated-orcid":false,"given":"Sheng","family":"Jin","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3213-1569","authenticated-orcid":false,"given":"Qifu Tyler","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5351-2075","authenticated-orcid":false,"given":"Zongpeng","family":"Li","sequence":"additional","affiliation":[{"name":"Institute for Network Sciences and Cyberspace, Tsinghua University, Beijing, 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 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"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2220119"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839596"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975776"},{"issue":"1","key":"ref9","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2016019"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2018.05.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2622277"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1515\/9783110642094-013"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2955106"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITW61385.2024.10807010"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2017042"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.12.003"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0108-0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2018.02.027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0077-3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2832624"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2890260"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3622163"},{"key":"ref26","article-title":"Rank-metric codes and applications","author":"Gabidulin","year":"2011"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71522-9_387"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2025.3622163"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2974476"},{"key":"ref30","volume-title":"Finite Fields","author":"Lidl","year":"1997"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3001133"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.9772"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00350-4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831861"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2179842"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref37","first-page":"1","article-title":"Row-diagonal parity for double disk failure correction","volume-title":"Proc. 3rd USENIX Conf. File Storage Technol.","author":"Corbett"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3300919"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3383849"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2025.3541085"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553670"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1080\/0025570X.1994.11996233"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1561\/0100000119"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11493629\/11432929.pdf?arnumber=11432929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:48:51Z","timestamp":1777319331000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11432929\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":43,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3673346","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}