{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:53:31Z","timestamp":1784904811155,"version":"3.55.0"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62201395"],"award-info":[{"award-number":["62201395"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20210044"],"award-info":[{"award-number":["BK20210044"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tcomm.2024.3459851","type":"journal-article","created":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T17:52:33Z","timestamp":1726163553000},"page":"1458-1473","source":"Crossref","is-referenced-by-count":7,"title":["Reduced-Complexity Projection-Aggregation List Decoder for Reed-Muller Codes"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2390-0664","authenticated-orcid":false,"given":"Jiajie","family":"Li","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, McGill University, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1745-4135","authenticated-orcid":false,"given":"Huayi","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McGill University, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2550-3619","authenticated-orcid":false,"given":"Marwan","family":"Jalaleddine","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McGill University, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6226-6037","authenticated-orcid":false,"given":"Warren J.","family":"Gross","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, McGill University, Montreal, QC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/itwksps.2010.5503223"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref4","volume-title":"NR; Multiplexing and Channel Coding V17.1.0","year":"2022"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2017.2673829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.82"},{"issue":"2","key":"ref8","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1109\/TIT.2023.3286452","article-title":"Reed\u2013M\u00fcller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity","volume":"70","author":"Reeves","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref9","first-page":"177","article-title":"A proof that Reed\u2013M\u00fcller codes achieve Shannon capacity on symmetric channels","volume-title":"Proc. IEEE 64th Annu. Symp. Found. Comput. Sci. (FOCS)","author":"Abbe"},{"issue":"12","key":"ref10","doi-asserted-by":"crossref","first-page":"7311","DOI":"10.1109\/TIT.2020.3023487","article-title":"Reed\u2013M\u00fcller codes polarize","volume":"66","author":"Abbe","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref12","first-page":"10","article-title":"Performance of short polar codes under ML decoding","volume-title":"Proc. ICT-MobileSummit Conf.","author":"Arikan"},{"key":"ref13","first-page":"247","article-title":"A serial orthogonal decoder","volume":"37","author":"Green","year":"1966","journal-title":"Jet Propuls. Lab., Space Programs Summary"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057189"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"issue":"3","key":"ref16","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1109\/TIT.2005.864443","article-title":"Soft-decision decoding of Reed\u2013M\u00fcller codes: Recursive lists","volume":"52","author":"Dumer","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref17","first-page":"63","article-title":"Sequential stack decoding of binary Reed\u2013M\u00fcller codes","author":"Stolte","year":"2000","journal-title":"ITG FACHBERICHT"},{"key":"ref18","first-page":"1","article-title":"Look-Ahead soft-decision decoding of binary Reed\u2013M\u00fcller codes","volume-title":"Proc. Int. Symp. Inf. Theory Appl.","author":"Stolte"},{"issue":"12","key":"ref19","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1049\/el.2012.1459","article-title":"Stack decoding of polar codes","volume":"48","author":"Niu","year":"2012","journal-title":"Electron. Lett."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924016"},{"key":"ref23","article-title":"From sequential decoding to channel polarization and back again","author":"Ar\u0131kan","year":"2019","journal-title":"arXiv:1908.09594"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611445"},{"key":"ref25","first-page":"1","article-title":"A tree search approach for maximum-likelihood decoding of Reed\u2013M\u00fcller codes","volume-title":"Proc. IEEE Globecom Workshops (GC Wkshps)","author":"Hashemi"},{"issue":"8","key":"ref26","doi-asserted-by":"crossref","first-page":"4948","DOI":"10.1109\/TIT.2020.2977917","article-title":"Recursive projection-aggregation decoding of Reed\u2013M\u00fcller codes","volume":"66","author":"Ye","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref27","first-page":"1","article-title":"Reduced complexity RPA decoder for Reed\u2013M\u00fcller codes","volume-title":"Proc. 11th Int. Symp. Topics Coding (ISTC)","author":"Li"},{"key":"ref28","first-page":"1082","article-title":"Sparse multi-decoder recursive projection aggregation for Reed\u2013M\u00fcller codes","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Fathollahi"},{"key":"ref29","first-page":"42","article-title":"Decoding Reed\u2013M\u00fcller codes using redundant code constraints","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Lian"},{"key":"ref30","article-title":"Pruned collapsed projection-aggregation decoding of Reed\u2013M\u00fcller codes","author":"Huang","year":"2021","journal-title":"arXiv:2105.11878"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2022.3163622"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3051463"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC49272.2021.9594071"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3173152"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.111612.121898"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3052550"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2021.3123270"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF51394.2020.9443374"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2023.3306463"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3216921"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852852"},{"key":"ref44","first-page":"171","article-title":"Solving mixed-integer quadratic programming problems with IBM-CPLEX: A progress report","volume-title":"Proc. 26th RAMP Symp.","author":"Bliek"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/VETECS.2005.1543380"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1002\/0471739219"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.061611.110862"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/SOCC.2015.7406996"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SiPS55645.2022.9919209"},{"key":"ref50","volume-title":"A Course in Probability Theory","author":"Chung","year":"2001"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.110142"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.11.080038"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2019.2959093"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3361073"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439211"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2020.3005763"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/10934106\/10679663.pdf?arnumber=10679663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T18:19:08Z","timestamp":1742840348000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10679663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":58,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2024.3459851","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}