{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T06:43:50Z","timestamp":1765089830197,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1907053","CCF-2221379"],"award-info":[{"award-number":["CCF-1907053","CCF-2221379"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2386"],"award-info":[{"award-number":["N00014-21-1-2386"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1910344"],"award-info":[{"award-number":["W911NF1910344"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tit.2022.3204488","type":"journal-article","created":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T20:18:43Z","timestamp":1662409123000},"page":"7500-7514","source":"Crossref","is-referenced-by-count":7,"title":["Flexible Distributed Matrix Multiplication"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-0478","authenticated-orcid":false,"given":"Weiqi","family":"Li","sequence":"first","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6200-2368","authenticated-orcid":false,"given":"Zhen","family":"Chen","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3339-3085","authenticated-orcid":false,"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2038-2977","authenticated-orcid":false,"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6838-8038","authenticated-orcid":false,"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517963"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref3","first-page":"265","article-title":"Reining in the outliers in map-reduce clusters using Mantri","volume-title":"Proc. 9th USENIX Conf. Operating Syst. Design Implement. (OSDI)","author":"Ananthanarayanan"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Yu"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref9","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2019.2927558"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3068165"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref18","article-title":"Fundamental limits of coded linear transform","author":"Wang","year":"2018","journal-title":"arXiv:1804.09791"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394214"},{"key":"ref20","first-page":"5152","article-title":"Coded sparse matrix multiplication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3052934"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3103822"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-020-01887-y"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3143199"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref45","article-title":"Bivariate polynomial coding for efficient distributed matrix multiplication","author":"Hasircioglu","year":"2020","journal-title":"arXiv:2001.07227"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322629"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS49365.2020.9213028"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518059"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036763"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517750"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2917425"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2008.4770564"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2093139.2093141"},{"key":"ref54","first-page":"299","article-title":"Screaming fast Galois field arithmetic using Intel SIMD instructions","volume-title":"Proc. FAST","author":"Plank"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-013-1350-5"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027.ch23"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616144"},{"key":"ref59","article-title":"Adaptive gradient descent without descent","author":"Malitsky","year":"2019","journal-title":"arXiv:1910.09529"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849212"},{"volume-title":"Cost-efficient repair for storage systems using progressive engagement","year":"2019","author":"Jafarkhani","key":"ref61"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2022.3222736"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9925894\/9877878-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9925894\/09877878.pdf?arnumber=9877878","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T12:21:27Z","timestamp":1706790087000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9877878\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":62,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3204488","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}