{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:51Z","timestamp":1773377871400,"version":"3.50.1"},"reference-count":8,"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.9174065","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"263-268","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Maximum-Likelihood Decoding of Reed\u2013Muller RM(m\u22123,m) Codes"],"prefix":"10.1109","author":[{"given":"Andrew","family":"Thangaraj","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras,Department of Electrical Engineering,Chennai,India,600036"}]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[{"name":"Duke University,Department of Electrical and Computer Engineering,Durham,NC,USA,27708"}]}],"member":"263","reference":[{"key":"ref4","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref3","first-page":"247","article-title":"A serial orthogonal decoder","volume":"37","author":"green","year":"1966","journal-title":"JPL Space Programs Sum-mary"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056662"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831835"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1137\/1.9781611975031.44","article-title":"Syndrome decoding of reed-muller codes and tensor decomposition over finite fields","author":"kopparty","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1137\/0204014","article-title":"Matrix factorization over GF(2) and trace-orthogonal bases of GF(2n)","volume":"4","author":"lempel","year":"1975","journal-title":"SIAM Journal on Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"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"}],"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\/09174065.pdf?arnumber=9174065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:25Z","timestamp":1773347725000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174065","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}