{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:07:16Z","timestamp":1769310436088,"version":"3.49.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Union\u2019s Horizon 2020 Research and Innovation Program","award":["715111"],"award-info":[{"award-number":["715111"]}]},{"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"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62101464"],"award-info":[{"award-number":["62101464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3158828","type":"journal-article","created":{"date-parts":[[2022,3,19]],"date-time":"2022-03-19T01:33:14Z","timestamp":1647653594000},"page":"5496-5512","source":"Crossref","is-referenced-by-count":18,"title":["Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0746-9819","authenticated-orcid":false,"given":"Qifa","family":"Yan","sequence":"first","affiliation":[{"name":"LTCI, Tèlècom Paris, IP Paris, Palaiseau, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0643-0445","authenticated-orcid":false,"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[{"name":"L2S, (UMR CNRS 8506), CentraleSupèlec, Paris-Saclay University, Gif-sur-Yvette, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6737-5427","authenticated-orcid":false,"given":"Michele","family":"Wigger","sequence":"additional","affiliation":[{"name":"LTCI, Tèlècom Paris, IP Paris, Palaiseau, France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613519"},{"key":"ref2","first-page":"1","article-title":"MapReduce: Simplified data processing on large clusters","volume-title":"Proc. 6th USENIX OSDI","author":"Dean"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437882"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278011"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006961"},{"key":"ref10","first-page":"1","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. The 31st Annu. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996730"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2702605"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841765"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437709"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437333"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852338"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2016.7841903"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437672"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278019"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437653"},{"key":"ref28","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in synchronous gradient descent","volume-title":"Proc. 34th Int. Conf. Mach. Learn. (ICML)","author":"Tandon"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437887"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2847679"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2765629"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647133"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2992989"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437323"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613522"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849570"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3020549"},{"key":"ref42","article-title":"Coded computing: A transformative framework for resilient, secure, private, and communication efficient large scale distributed computing","author":"Yu","year":"2020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457640"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09738546.pdf?arnumber=9738546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:38:00Z","timestamp":1705538280000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9738546\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":44,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3158828","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}