{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:56:44Z","timestamp":1778605004378,"version":"3.51.4"},"reference-count":42,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517963","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1576-1581","source":"Crossref","is-referenced-by-count":7,"title":["Flexible Constructions for Distributed Matrix Multiplication"],"prefix":"10.1109","author":[{"given":"Weiqi","family":"Li","sequence":"first","affiliation":[{"name":"University of California,Center for Pervasive Communications and Computing (CPCC),Irvine,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Chen","sequence":"additional","affiliation":[{"name":"University of California,Center for Pervasive Communications and Computing (CPCC),Irvine,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California,Center for Pervasive Communications and Computing (CPCC),Irvine,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[{"name":"University of California,Center for Pervasive Communications and Computing (CPCC),Irvine,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[{"name":"University of California,Center for Pervasive Communications and Computing (CPCC),Irvine,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952051"},{"key":"ref38","first-page":"1","article-title":"Bivariate hermitian polynomial coding for efficient distributed matrix multiplicationn","author":"has?rc?o?lu","year":"0","journal-title":"2020 IEEE Global Communications Conference"},{"key":"ref33","article-title":"Private and rateless adaptive coded matrix-vector multiplication","author":"bitar","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2988506"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3052934"},{"key":"ref30","author":"jia","year":"2019","journal-title":"Cross-subspace alignment codes for coded distributed batch computation"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref36","author":"has?rc?oglu","year":"2020","journal-title":"Bivariate polynomial coding for exploiting stragglers in heterogeneous coded computing systems"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref34","article-title":"Adaptive private distributed matrix multiplication","author":"bitar","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref40","author":"ozfatura","year":"2020","journal-title":"Straggler-aware distributed learning Communication computation latency trade-off"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref12","article-title":"Codedsketch: A coding scheme for distributed computation of approximated matrix multiplications","author":"jahani-nezhad","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref15","article-title":"Fundamental limits of coded linear transform","author":"wang","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3393691.3394214"},{"key":"ref17","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref4","author":"dutta","year":"2018","journal-title":"A Unified Coded Deep Neural Network Training Strategy Based on Generalized PolyDot Codes for Matrix Multiplication"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref6","author":"yu","year":"2018","journal-title":"Lagrange coded computing Optimal design for resiliency security and privacy"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849606"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref2","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref9","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-013-1350-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.29007\/22vr"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517963.pdf?arnumber=9517963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:42Z","timestamp":1773347682000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517963","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}