{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:32Z","timestamp":1773376592331,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206574","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2057-2062","source":"Crossref","is-referenced-by-count":3,"title":["Achieving Capacity on Non-Binary Channels with Generalized Reed\u2013Muller Codes"],"prefix":"10.1109","author":[{"given":"Galen","family":"Reeves","sequence":"first","affiliation":[{"name":"Duke University,Departments of Electrical and Computer Engineering"}]},{"given":"Henry D.","family":"Pfister","sequence":"additional","affiliation":[{"name":"Duke University,Departments of Electrical and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Reed-Muller codes achieve capacity on BMS channels","author":"reeves","year":"2021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006466"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref34","author":"artin","year":"2011","journal-title":"Algebra Pearson Education"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030457"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836693"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2015992"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.133243"},{"key":"ref11","first-page":"1479","article-title":"On codes decoding a constant fraction of errors on the BSC","author":"h?z?a","year":"2021","journal-title":"Proc 6 Annual ACM Symp on Theory of Computing"},{"key":"ref33","article-title":"Group theory (v4.00)","author":"milne","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023487"},{"key":"ref32","first-page":"124","article-title":"On the absolute constants in the Berry–Esseen inequality and its structural and nonuniform improvements","volume":"7","author":"shevtsova","year":"2013","journal-title":"Informatika i Ee Primeneniya [Informatics and its Applications]"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054127"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4946-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729032"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700857"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0128010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2236382"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206574"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/cbms\/1462061029"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb02379.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839743"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620260"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033729"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01072842"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb02486.x"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057538"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897584"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.82"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"ref5","first-page":"167","article-title":"High-rate codes with sublineartime decoding","author":"kopparty","year":"2011","journal-title":"Proc 6 Annual ACM Symp on Theory of Computing"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206574.pdf?arnumber=10206574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:44Z","timestamp":1773347204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206574\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206574","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}