{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:59:33Z","timestamp":1763791173031,"version":"3.45.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:00:00Z","timestamp":1759104000000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,29]]},"DOI":"10.1109\/itw62417.2025.11240441","type":"proceedings-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:39:40Z","timestamp":1763750380000},"page":"680-685","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Distance Decoding for Reed-Muller Codes using Projection-Aggregation"],"prefix":"10.1109","author":[{"given":"Bin","family":"Zhang","sequence":"first","affiliation":[{"name":"Beihang University,Department of Electronic and Information Engineering,Beijing,China"}]},{"given":"Qin","family":"Huang","sequence":"additional","affiliation":[{"name":"Beihang University,Department of Electronic and Information Engineering,Beijing,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref3","first-page":"202","article-title":"On decoding complexity of low-rate Reed-Muller codes","volume-title":"Proc. 9th All-Union Conf. Coding Theory and Inf. Transmission","author":"Litsyn"},{"key":"ref4","first-page":"87","article-title":"On decoding of Reed-Muller codes in semicontinuous channels","volume-title":"Proc. 2nd Int. Workshop Algebraic and Combinatorial Coding Theory","author":"Kabatyanskii"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054629"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2013.012313.110415"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3192896"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849320"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3211101"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3128541"},{"issue":"3","key":"ref14","first-page":"3","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2005.1531882"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.82"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps52748.2021.9682042"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3364989"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517887"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3459851"},{"volume-title":"The theory of error correcting codes","year":"1977","author":"MacWilliams","key":"ref23"},{"article-title":"Pruned collapsed projection-aggregation decoding of Reed-Muller codes","year":"2021","author":"Huang","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517885"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2022.3163622"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619095"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195324"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541600"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/0100000123"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90174-0"}],"event":{"name":"2025 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2025,9,29]]},"location":"Sydney, Australia","end":{"date-parts":[[2025,10,3]]}},"container-title":["2025 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11240243\/11240249\/11240441.pdf?arnumber=11240441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T05:54:52Z","timestamp":1763790892000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11240441\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,29]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw62417.2025.11240441","relation":{},"subject":[],"published":{"date-parts":[[2025,9,29]]}}}