{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:33:13Z","timestamp":1775579593862,"version":"3.50.1"},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195602","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Recursive Decoding of Binary Rank Reed-Muller Codes and Plotkin Construction for Matrix Codes"],"prefix":"10.1109","author":[{"given":"Alain","family":"Couvreur","sequence":"first","affiliation":[{"name":"École Polytechnique, Institut Polytechnique de Paris,Inria & Laboratoire LIX, CNRS UMR 7161,Cedex,91120"}]},{"given":"Rakhi","family":"Pratihar","sequence":"additional","affiliation":[{"name":"École Polytechnique, Institut Polytechnique de Paris,Inria & Laboratoire LIX, CNRS UMR 7161,Cedex,91120"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"issue":"1","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/20M1348583"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63697-9_7"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11779360_4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/0100000119"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY48165.2019.9003356"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513676"},{"key":"ref9","article-title":"Decoding rank metric Reed-Muller codes","author":"Couvreur","year":"2025","journal-title":"arXiv preprint arXiv"},{"key":"ref10","first-page":"39","article-title":"The theory of error-correcting codes","volume":"2","author":"MacWilliams","year":"1977","journal-title":"Elsevier Science Publishers BV google schola"},{"key":"ref11","article-title":"Wave","volume-title":"Round 1 Additional Signatures to the NIST Post-Quantum Cryptography: Digital Signature Schemes Call","author":"Banegas","year":"2023"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34578-5_2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006479"},{"key":"ref14","volume-title":"SageMath, the Sage Mathematics Software System (Version 9.5)","year":"2022"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2511786"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541435"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195602.pdf?arnumber=11195602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:44Z","timestamp":1773347384000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195602","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}