{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T17:04:26Z","timestamp":1781370266088,"version":"3.54.1"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100011199","name":"ERC","doi-asserted-by":"publisher","award":["715111"],"award-info":[{"award-number":["715111"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61941106"],"award-info":[{"award-number":["61941106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tcomm.2020.3020549","type":"journal-article","created":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T20:57:28Z","timestamp":1598907448000},"page":"7311-7327","source":"Crossref","is-referenced-by-count":17,"title":["A Fundamental Storage-Communication Tradeoff for Distributed Computing With Straggling Nodes"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0746-9819","authenticated-orcid":false,"given":"Qifa","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6737-5427","authenticated-orcid":false,"given":"Michele","family":"Wigger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0643-0445","authenticated-orcid":false,"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7938-7812","authenticated-orcid":false,"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2901686"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04042-x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682404"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/NCC48643.2020.9055996"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437603"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2893942"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2702605"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2962028"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841765"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437709"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437333"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437653"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref16","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc 31st Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437887"},{"key":"ref4","first-page":"281","article-title":"Map-reduce for machine learning on multicore","author":"chu","year":"2000","journal-title":"Proc 20th Ann Conf Neural Inf Process Syst (NIPS)"},{"key":"ref27","first-page":"4305","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/297672"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278011"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref8","article-title":"Storage-computation-communication tradeoff in distributed computing: Fundamental tradeoff and complexity","author":"yan","year":"2018","journal-title":"arXiv 1806 07565"},{"key":"ref7","first-page":"1","article-title":"A storage-computation-communication tradeoff for distributed computing","author":"yan","year":"2018","journal-title":"Proc Int Symp on Wireless Commun Syst (ISWCS)"},{"key":"ref2","first-page":"1","article-title":"MapReduce: Simplified data processing on large clusters","author":"dean","year":"2004","journal-title":"Proc 6th USENIX OSDI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996730"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849615"},{"key":"ref46","first-page":"631","article-title":"A unified Ruzsa-Szemerédi framework for finite-length coded caching","author":"shanmugam","year":"2017","journal-title":"Proc 51st Asilomar Conf Signals Syst Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800059"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.1002\/0471722162","author":"david","year":"2003","journal-title":"Order Statistics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2896960"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613522"},{"key":"ref26","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in synchronous gradient desent","volume":"70","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9295471\/09181592.pdf?arnumber=9181592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:22:37Z","timestamp":1643149357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9181592\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":47,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3020549","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}