{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:48Z","timestamp":1773377988210,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849615","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2803-2807","source":"Crossref","is-referenced-by-count":21,"title":["A Fundamental Storage-Communication Tradeoff in Distributed Computing with Straggling Nodes"],"prefix":"10.1109","author":[{"given":"Qifa","family":"Yan","sequence":"first","affiliation":[{"name":"LTCI, Télécom ParisTech, Paris, 75013, France"}]},{"given":"Mich\u00e8le","family":"Wigger","sequence":"additional","affiliation":[{"name":"LTCI, Télécom ParisTech, Paris, 75013, France"}]},{"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[{"name":"L2S, CentraleSupélec, Gif-sur-Yvette, 91190, France"}]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[{"name":"Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu, 611756, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref11","article-title":"Gradient coding from cyclic MDS codes and expander graphs","author":"raviv","year":"0"},{"key":"ref12","article-title":"A fundamental storagecommunication tradeoff in distributed computing with stragging nodes","author":"yan","year":"0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725272"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613519"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref8","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc The 31st Annual Conf Neural Inf Processing System (NIPS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682404"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/297672"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849615.pdf?arnumber=8849615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:47Z","timestamp":1773347747000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849615\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849615","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}