{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:28:33Z","timestamp":1784644113292,"version":"3.55.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3192896","type":"journal-article","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T19:37:35Z","timestamp":1659123455000},"page":"2206-2217","source":"Crossref","is-referenced-by-count":5,"title":["Recursive Decoding of Reed-Muller Codes Starting With the Higher-Rate Constituent Code"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0430-2781","authenticated-orcid":false,"given":"Mikhail","family":"Kamenev","sequence":"first","affiliation":[{"name":"Moscow Research Center, Huawei Technologies Company Ltd., Moscow, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517949"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref4","first-page":"202","article-title":"On decoding complexity of low-rate Reed-Muller codes","volume-title":"Proc. 9th Union Conf. Coding Theory Inf. Transmiss.","author":"Litsyn"},{"key":"ref5","first-page":"87","article-title":"On decoding of Reed-Muller codes in semicontinuous channels","volume-title":"Proc. 2nd Int. Workshop Algebr. Combinat. Coding Theory","author":"Kabatyanskii"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.370093"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826632"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref9","volume-title":"Recursive codes with the Plotkin construction and their decoding","author":"Stolte","year":"2002"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625281"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref12","article-title":"Decoding Reed-Muller codes with successive codeword permutations","author":"Doan","year":"2021","journal-title":"arXiv:2109.02122"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2022.3190203"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3121442"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041392"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517887"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3128541"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611445"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps52748.2021.9682042"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/s0924-6509(08)x7030-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref26","first-page":"247","article-title":"A serial orthogonal decoder","volume":"37","author":"Green","year":"1966","journal-title":"JPL Space Programs Summary"},{"key":"ref27","first-page":"63","article-title":"Sequential stack decoding of binary Reed-Muller codes","volume-title":"Proc. ITG FACHBERICHT","author":"Stolte"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831835"},{"key":"ref29","volume-title":"Error Control Coding","author":"Lin","year":"2004"},{"key":"ref30","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919799"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174065"},{"key":"ref33","volume-title":"Database of Channel Codes and ML Simulation Results","author":"Helmling","year":"2019"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09845388.pdf?arnumber=9845388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T09:14:32Z","timestamp":1706778872000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9845388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3192896","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}