{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:59:51Z","timestamp":1778605191335,"version":"3.51.4"},"reference-count":64,"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":"am","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":"Systems on Nanoscale Information fabriCs"},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1350314"],"award-info":[{"award-number":["CCF-1350314"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1464336"],"award-info":[{"award-number":["CCF-1464336"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1553248"],"award-info":[{"award-number":["CCF-1553248"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-1702694"],"award-info":[{"award-number":["CNS-1702694"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["1763657"],"award-info":[{"award-number":["1763657"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1109\/tit.2019.2929328","type":"journal-article","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T20:27:41Z","timestamp":1563395261000},"page":"278-301","source":"Crossref","is-referenced-by-count":207,"title":["On the Optimal Recovery Threshold of Coded Matrix Multiplication"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6500-2627","authenticated-orcid":false,"given":"Sanghamitra","family":"Dutta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4266-7087","authenticated-orcid":false,"given":"Mohammad","family":"Fahim","sequence":"additional","affiliation":[]},{"given":"Farzin","family":"Haddadpour","sequence":"additional","affiliation":[]},{"given":"Haewon","family":"Jeong","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6786-8785","authenticated-orcid":false,"given":"Viveck","family":"Cadambe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7651-7776","authenticated-orcid":false,"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"5606","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006962"},{"key":"ref37","article-title":"Fundamental limits of coded linear transform","author":"wang","year":"2018","journal-title":"arXiv 1804 09791"},{"key":"ref36","first-page":"5139","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682347"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635933"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028518"},{"key":"ref61","first-page":"1","article-title":"CodeNet: Training large scale neural networks in presence of soft-errors","author":"dutta","year":"2019","journal-title":"Proc Workshop Coding Theory Large-Scale Mach Learn Int Conf Mach Learn (ICML)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb01087.x"},{"key":"ref28","first-page":"709","article-title":"Coded distributed computing for inverse problems","author":"yang","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.2307\/2322638"},{"key":"ref27","first-page":"5440","article-title":"Straggler mitigation in distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262881"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref20","first-page":"4302","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/3199524.3199564","article-title":"Straggler mitigation by delayed relaunch of tasks","volume":"45","author":"aktas","year":"2018","journal-title":"ACM SIGMETRICS Perform Eval Rev"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3152042.3152047"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869791"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007058"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0442"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.2307\/2004623"},{"key":"ref59","first-page":"289","article-title":"GRASS: Trimming stragglers in approximation analytics","author":"ananthanarayanan","year":"2014","journal-title":"Proc 1st USENIX Symp Netw Syst Design Implement (NSDI '04)"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.15"},{"key":"ref57","first-page":"1","article-title":"Improving MapReduce performance in heterogeneous environments","author":"zaharia","year":"2008","journal-title":"Proc of the 2nd USENIX Symp on Operating Systems Design and Implementation (OSDI)"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/1008061"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.2307\/2313246"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1969.1099332"},{"key":"ref10","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2917855"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852335"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692244"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2016.7593105"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.33"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref19","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref5","first-page":"1","article-title":"Gradient coding","author":"tandon","year":"2016","journal-title":"Proc Mach Learn Syst Workshop Adv Neural Inf Process Syst (NIPS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2847220.2847223"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140518"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592042"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref48","article-title":"Fast evaluation and interpolation","author":"kung","year":"1973"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref41","author":"herault","year":"2015","journal-title":"Fault-Tolerance Techniques for High-Performance Computing"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref43","first-page":"3","article-title":"Codes for distributed computing: A tutorial","volume":"67","author":"cadambe","year":"2017","journal-title":"IEEE Inf Theory Soc News Lett"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/8939138\/8765375-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8939138\/08765375.pdf?arnumber=8765375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:20:10Z","timestamp":1651080010000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8765375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":64,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2929328","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}