{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:44Z","timestamp":1773377804719,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849269","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2064-2068","source":"Crossref","is-referenced-by-count":15,"title":["Recursive projection-aggregation decoding of Reed-Muller codes"],"prefix":"10.1109","author":[{"given":"Min","family":"Ye","sequence":"first","affiliation":[{"name":"EPFL and Princeton University"}]},{"given":"Emmanuel","family":"Abbe","sequence":"additional","affiliation":[{"name":"Princeton University"}]}],"member":"263","reference":[{"key":"ref10","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 Ninth International Workshop on Algebraic and Combinatorial Coding theory ACCT-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2005.1531882"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826632"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864425"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2671410"},{"key":"ref16","article-title":"On the performance of Reed-Muller codes with respect to random errors and erasures","author":"sberlo","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345069"},{"key":"ref3","article-title":"A performance comparison of polar codes and Reed-Muller codes","volume":"12","author":"ar?kan","year":"2008","journal-title":"IEEE Communications Letters"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref8","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1109\/FOCS.2019.00026","article-title":"Reed-Muller codes polarize","author":"abbe","year":"2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref9","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":"Problemy Peredachi Informatsii"},{"key":"ref20","article-title":"Final report of 3GPP TSG RAN WG1 #87 v1.0.0","year":"0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849269"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849269.pdf?arnumber=8849269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:13Z","timestamp":1773347713000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849269","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}