{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:30:27Z","timestamp":1753601427456,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Research Council (ECR) Advanced Grants","award":["74079 (ALGSTRONGCRYPTO)"],"award-info":[{"award-number":["74079 (ALGSTRONGCRYPTO)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/tit.2019.2939135","type":"journal-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T19:27:06Z","timestamp":1567538826000},"page":"263-272","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex"],"prefix":"10.1109","volume":"66","author":[{"given":"Ronald","family":"Cramer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1257-1033","authenticated-orcid":false,"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-8397","authenticated-orcid":false,"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.84.7.1739"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01884295"},{"key":"ref12","first-page":"685","article-title":"A Fourier-analytic approach to Reed–Müller decoding","author":"gopalan","year":"2010","journal-title":"Proc FOCS"},{"key":"ref13","first-page":"265","article-title":"List-decoding Reed–Müller codes over small fields","author":"gopalan","year":"2008","journal-title":"Proc STOC"},{"key":"ref14","article-title":"High-rate locally correctable codes via lifting","author":"guo","year":"2014","journal-title":"arXiv 1304 1202"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.24"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692212"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053873"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref4","first-page":"277","article-title":"The list decoding radius for Reed–Müller codes over small fields","author":"bhowmick","year":"2015","journal-title":"Proc STOC"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488714"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_1"},{"key":"ref5","first-page":"521","article-title":"Algebraic geometric secret sharing schemes and secure multi-party computations over small fields","author":"chen","year":"2006","journal-title":"Proc Crypto"},{"key":"ref8","first-page":"316","article-title":"General secure multi-party Computation from any linear secret-sharing scheme","author":"cramer","year":"2000","journal-title":"Proc EUROCRYPT"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404767"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365687"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.856958"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2629416"},{"key":"ref22","first-page":"107","article-title":"Locally correctable and testable codes approaching the singleton bound","volume":"21","author":"meir","year":"2014","journal-title":"Proc Electron Colloq Comput Complex (ECCC)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0278-0"},{"key":"ref24","article-title":"Efficiently decoding Reed-Müller codes from random errors","author":"saptharishi","year":"2015","journal-title":"arXiv 1503 09092"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.825043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3810-9"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-76878-4","author":"stictenoth","year":"2009","journal-title":"Algebraic Function Fields and Codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8939138\/08823050.pdf?arnumber=8823050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T10:16:12Z","timestamp":1664273772000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8823050\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":27,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2939135","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}