{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:36:40Z","timestamp":1774679800503,"version":"3.50.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174087","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"42-47","source":"Crossref","is-referenced-by-count":37,"title":["Decoding Reed\u2013Muller Codes Using Redundant Code Constraints"],"prefix":"10.1109","author":[{"given":"Mengke","family":"Lian","sequence":"first","affiliation":[{"name":"Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina"}]},{"given":"Christian","family":"H\u00e4ger","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology,Department of Electrical Engineering,Gothenburg,Sweden"}]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[{"name":"Duke University,Department of Electrical and Computer Engineering,Durham,North Carolina"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"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":"Problemy peradichi informatsii"},{"key":"ref12","article-title":"Modified version of Sidel’nikov-Pershakov decoding algorithm for binary second order Reed-Muller codes","author":"loidreau","year":"2004","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"ref13","article-title":"Decoding of second order Reed–Muller codes with a large number of errors","author":"sakkour","year":"2005","journal-title":"Proc IEEE Information Theory Workshop (ITW)"},{"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.864425"},{"key":"ref17","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849269"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3585-7_17"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849269"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625281"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057216"},{"key":"ref1","first-page":"6","article-title":"Application of Boolean algebra to switching circuit design and to error detection","volume":"ec 3","author":"muller","year":"1954","journal-title":"IRE Tran on Electronic Computers"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2007.898699"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831835"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849419"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2017.2788405"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174087.pdf?arnumber=9174087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:19Z","timestamp":1773347659000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174087","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}