{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T09:08:56Z","timestamp":1771146536830,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"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":[[2020,8]]},"DOI":"10.1109\/tit.2020.2977917","type":"journal-article","created":{"date-parts":[[2020,3,3]],"date-time":"2020-03-03T22:18:08Z","timestamp":1583273888000},"page":"4948-4965","source":"Crossref","is-referenced-by-count":66,"title":["Recursive Projection-Aggregation Decoding of Reed-Muller Codes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1351-8880","authenticated-orcid":false,"given":"Min","family":"Ye","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Abbe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004466"},{"key":"ref30","author":"polyanskiy","year":"2010","journal-title":"Channel Coding Non-Asymptotic Fundamental Limits"},{"key":"ref10","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref11","first-page":"80","article-title":"Decoding of Reed–Muller codes with a large number of errors","volume":"28","author":"sidel\u2019nikov","year":"1992","journal-title":"Probl Peredachi Inf"},{"key":"ref12","first-page":"266","article-title":"Modified version of Sidel’nikov-Pershakov decoding algorithm for binary second order Reed–Muller codes","author":"loidreau","year":"2004","journal-title":"Proc 9th Int Workshop on Algebraic and Combinator Coding Theory"},{"key":"ref13","first-page":"176","article-title":"Decoding of second order Reed–Muller codes with a large number of errors","author":"sakkour","year":"2005","journal-title":"Proc IEEE Inf Theory Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826632"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864425"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2671410"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.82"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref28","first-page":"1","article-title":"Decoding Reed–Muller and polar codes by successive factor graph permutations","author":"hashemi","year":"2018","journal-title":"Proc IEEE 10th Int Symp Turbo Codes Iterative Inf Process (ISTC)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2008.080017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504299"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345069"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00026"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849269"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref22","year":"2017","journal-title":"Final Report of 3 GPP TSG RAN WG1 #87 v1 0 0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref24","first-page":"247","article-title":"A serial orthogonal decoder","volume":"iv","author":"green","year":"1966","journal-title":"JPL Space Programs Summary"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437453"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439211"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057189"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9141502\/09023389.pdf?arnumber=9023389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:22:44Z","timestamp":1651080164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9023389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":31,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2977917","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8]]}}}