{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:11Z","timestamp":1773377951612,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517885","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1088-1093","source":"Crossref","is-referenced-by-count":13,"title":["Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding"],"prefix":"10.1109","author":[{"given":"Mohammad Vahid","family":"Jamali","sequence":"first","affiliation":[{"name":"University of Michigan,EECS Department"}]},{"given":"Xiyang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Washington,CSE Department"}]},{"given":"Ashok Vardhan","family":"Makkuva","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign,ECE Department"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"University of Michigan,EECS Department"}]},{"given":"Sewoong","family":"Oh","sequence":"additional","affiliation":[{"name":"University of Washington,CSE Department"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign,ECE Department"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.826632"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864425"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref13","first-page":"3","article-title":"Decoding of second order Reed-Muller codes with a large number of errors","author":"sakkour","year":"2005","journal-title":"IEEE Inf Theory Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2671410"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref17","article-title":"Sparse multi-decoder recursive projection aggregation for Reed-Muller codes","author":"fathollahi","year":"0","journal-title":"ArXiv Preprint"},{"key":"ref18","volume":"16","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref19","article-title":"Reed-Muller subcodes: Machine learning-aided design of efficient soft recursive decoding","author":"jamali","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437453"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184841"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936192"},{"key":"ref20","article-title":"Differentiable top-k with optimal transport","volume":"33","author":"xie","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref22","year":"0","journal-title":"Bcewithlogitsloss"},{"key":"ref21","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517885.pdf?arnumber=9517885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:40Z","timestamp":1773347740000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517885\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517885","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}