{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:20Z","timestamp":1740131660465,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1109\/tit.2018.2863713","type":"journal-article","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T18:25:30Z","timestamp":1533579930000},"page":"184-197","source":"Crossref","is-referenced-by-count":1,"title":["Robust Multiplication-Based Tests for Reed\u2013Muller Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2739-5642","authenticated-orcid":false,"given":"Prahladh","family":"Harsha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6491-124X","authenticated-orcid":false,"given":"Srikanth","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-015-1231-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1995.377032"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/140995520"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1162349.1162351"},{"key":"ref15","article-title":"Robust multiplication-based tests for Reed–Müller codes","author":"harsha","year":"2016","journal-title":"Proc 36th IARCS Annu Conf Found Softw Tech Theor Comput Sci (FSTTCS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/120879257"},{"journal-title":"$2^ (\\log N) ^ 1\/10-o(1) $ hardness for hypergraph coloring","year":"2015","author":"huang","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054226"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704445615"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"article-title":"Probabilistic checking of proofs and hardness of approximation problems","year":"1994","author":"arora","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0025-0"},{"key":"ref8","first-page":"488","article-title":"Optimal testing of Reed–Müller codes","author":"bhattacharyya","year":"2010","journal-title":"Proc IEEE Symp Foundations Comput Sci (FOCS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/130929394"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856958"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-16721-3","author":"cox","year":"2015","journal-title":"Ideals Varieties and Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/15100240X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","author":"van lint","year":"1999","journal-title":"Introduction to Coding Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.2015.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8581519\/08426004.pdf?arnumber=8426004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:00Z","timestamp":1657746540000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8426004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":24,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2863713","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}