{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:07:02Z","timestamp":1787760422130,"version":"build-2784847793"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/tit.2012.2184841","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T21:53:23Z","timestamp":1328046803000},"page":"2689-2696","source":"Crossref","is-referenced-by-count":38,"title":["Weight Distribution and List-Decoding Size of Reed\u2013Muller Codes"],"prefix":"10.1109","volume":"58","author":[{"given":"Tali","family":"Kaufman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shachar","family":"Lovett","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054545"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(76)90355-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825043"},{"key":"ref14","first-page":"1351","article-title":"On algebraic decoding of <formula formulatype=\"inline\"> <tex Notation=\"TeX\">$q$<\/tex><\/formula>-ary Reed&#x2013;Muller and Product&#x2013;Reed&#x2013;Solomon codes","author":"santhi","year":"2007","journal-title":"Proc ISIT 2007"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/346048.346049"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374417"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9184-8"},{"key":"ref8","first-page":"138","article-title":"List decoding of Reed&#x2013;Muller codes up to the johnson bound with almost linear complexity","author":"kabatiansky","year":"2006","journal-title":"IEEE Int Symp Information Theory"},{"key":"ref7","author":"guruswami","year":"2001","journal-title":"List decoding of error-correcting codes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/070712109"},{"key":"ref1","author":"noga","year":"1992","journal-title":"The Probabilistic Method"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.17"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6185725\/06142078.pdf?arnumber=6142078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:15Z","timestamp":1633909995000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6142078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":15,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2184841","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}