{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:25:53Z","timestamp":1761294353112,"version":"3.37.3"},"reference-count":67,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF\u20131763348","CCF\u20131909771","CCF\u20131941633"],"award-info":[{"award-number":["CCF\u20131763348","CCF\u20131909771","CCF\u20131941633"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"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.3103772","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T20:19:34Z","timestamp":1628626774000},"page":"879-892","source":"Crossref","is-referenced-by-count":9,"title":["Coded Computing via Binary Linear Codes: Designs and Performance Limits"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5495-901X","authenticated-orcid":false,"given":"Mahdi","family":"Soleymani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5007-0221","authenticated-orcid":false,"given":"Mohammad Vahid","family":"Jamali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9021-1992","authenticated-orcid":false,"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174309"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977918"},{"journal-title":"Berrut approximated coded computing Straggler resistance beyond polynomial computing","year":"2020","author":"jahani-nezhad","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3056377"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437453"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2462817"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919767"},{"key":"ref60","first-page":"1576","article-title":"Non-asymptotic theory of random matrices: extreme singular values","author":"rudelson","year":"2010","journal-title":"Proc Int Congr Math (ICM)"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2184841"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2009.04.016"},{"journal-title":"Reed-Muller subcodes Machine learning-aided design of efficient soft recursive decoding","year":"2021","author":"jamali","key":"ref63"},{"journal-title":"List-decodable coded computing Breaking the adversarial toleration barrier","year":"2021","author":"soleymani","key":"ref28"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050853"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647982"},{"journal-title":"Massive coded-NOMA for low-capacity channels A low-complexity recursive approach","year":"2020","author":"jamali","key":"ref66"},{"journal-title":"Privacy-preserving distributed learning in the analog domain","year":"2020","author":"soleymani","key":"ref29"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3675-0"},{"key":"ref2","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","author":"ananthanarayanan","year":"0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989097"},{"key":"ref20","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-020-01887-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/0613023"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2008.01.010"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654089"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/040616413"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/11428831_15"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/78.752604"},{"key":"ref54","first-page":"239","article-title":"Multiple error correction with analog codes","author":"henkel","year":"1988","journal-title":"Proc Symp Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2002.807876"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/97.823525"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref13","first-page":"2100","article-title":"‘Short-dot’: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"journal-title":"Coded sparse matrix multiplication","year":"2018","author":"wang","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3036961"},{"journal-title":"CodedSketch A coding scheme for distributed computation of approximated matrix multiplication","year":"2018","author":"jahani-nezhad","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2796314.2745873"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535392"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3128601"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref7","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":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0463-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/18.30988"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2748955"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2816934"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2671410"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.2307\/2152887"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848010"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9540917\/9509769-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9540917\/09509769.pdf?arnumber=9509769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:11Z","timestamp":1649444111000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9509769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":67,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3103772","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}