{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:22:52Z","timestamp":1763810572830,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR001117C0053"],"award-info":[{"award-number":["HR001117C0053"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1810400"],"award-info":[{"award-number":["W911NF1810400"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1703575","CCF-1763673","CCF\u20131763348","CCF\u20131909771","CCF\u20131941633"],"award-info":[{"award-number":["CCF-1703575","CCF-1763673","CCF\u20131763348","CCF\u20131909771","CCF\u20131941633"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF\/Intel Partnership on Machine Learning for Wireless Networking Systems","award":["2002874"],"award-info":[{"award-number":["2002874"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2189"],"award-info":[{"award-number":["N00014-16-1-2189"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Intel\/Avast\/Borsetta through the PrivateAI Institute"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/jsait.2021.3102956","type":"journal-article","created":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T20:19:01Z","timestamp":1628281141000},"page":"867-878","source":"Crossref","is-referenced-by-count":20,"title":["List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5495-901X","authenticated-orcid":false,"given":"Mahdi","family":"Soleymani","sequence":"first","affiliation":[]},{"given":"Ramy E.","family":"Ali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1992","authenticated-orcid":false,"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref38","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT44484.2020.9174512","article-title":"Numerically stable binary gradient coding","author":"charalambides","year":"2020"},{"article-title":"Private and rateless adaptive coded matrix-vector multiplication","year":"2019","author":"bitar","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref30","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT44484.2020.9174167","article-title":"Entangled polynomial codes for secure, private, and batch distributed matrix multiplication: Breaking the ‘cubic’ barrier","author":"yu","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"article-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings","year":"2019","author":"ramamoorthy","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"article-title":"Secure coded multi-party computation for massive matrix operations","year":"2019","author":"nodehi","key":"ref34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437525"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3058685"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.554"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0578-y"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.38"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0129-8"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref53","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume":"30","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Algebraic Codes on Lines Planes and Curves An Engineering Approach","year":"2008","author":"blahut","key":"ref52"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/2047-2501-2-3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3055341"},{"key":"ref12","first-page":"60","article-title":"Big Data: The management revolution","volume":"90","author":"mcafee","year":"2012","journal-title":"Harvard Bus Rev"},{"key":"ref13","first-page":"94","article-title":"List decoding for noisy channels","volume":"2","author":"elias","year":"1957","journal-title":"Proc IRE WESCON Convention Rec"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214429"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0100000103","article-title":"Coded computing: Mitigating fundamental bottlenecks in large-scale distributed computing and machine learning","volume":"17","author":"li","year":"2020","journal-title":"Found Trends Commun Inf Theory"},{"key":"ref3","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc IEEE 22nd Int Conf Artif Intell Stat"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3054610"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3053220"},{"article-title":"Privacy-preserving distributed learning in the analog domain","year":"2020","author":"soleymani","key":"ref8"},{"key":"ref7","first-page":"1","article-title":"A scalable approach for privacy-preserving collaborative machine learning","volume":"33","author":"so","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00029"},{"article-title":"Berrut approximated coded computing: Straggler resistance beyond polynomial computing","year":"2020","author":"jahani-nezhad","key":"ref9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.22"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.995539"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"article-title":"Verifiable coded computing: Towards fast, secure and private distributed machine learning","year":"2021","author":"tang","key":"ref41"},{"key":"ref44","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quart Progr Report"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989254"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9540917\/9508450-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9540917\/09508450.pdf?arnumber=9508450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T21:04:06Z","timestamp":1673039046000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9508450\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":55,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3102956","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}