{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:27Z","timestamp":1773377607750,"version":"3.50.1"},"reference-count":17,"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.8849451","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1777-1781","source":"Crossref","is-referenced-by-count":46,"title":["Universally Decodable Matrices for Distributed Matrix-Vector Multiplication"],"prefix":"10.1109","author":[{"given":"Aditya","family":"Ramamoorthy","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, 50010, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Tang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, 50010, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong, S. A. R."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"45","article-title":"Codes for the m-metric","volume":"33","author":"rosenbloom","year":"1997","journal-title":"Probl Inf Transm"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.899482"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2690850"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437322"},{"key":"ref14","article-title":"Download and access tradeoffs in Lagrange coded computing","author":"raviv","year":"2019","journal-title":"IEEE Int Symp on Inf Theory"},{"key":"ref15","first-page":"203","article-title":"Generalized Vandermonde determinants and applications","volume":"30","author":"sobczyk","year":"2002","journal-title":"Aportaciones Matemticas Serie Comunicaciones"},{"key":"ref16","first-page":"193","article-title":"How (un) stable are Vandermonde systems?","volume":"124","author":"gautschi","year":"1990","journal-title":"Asymptotic and Computational Analysis (Lecture Notes in Pure and Applied Mathematics)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","article-title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication","author":"mallick","year":"2018"},{"key":"ref5","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc of Adv in Neural Inf Proc Sys (NIPS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref7","first-page":"5139","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc 35th Int Conf on Mach Learning ICML"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2880213"},{"key":"ref1","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc of Adv in Neural Inf Proc Sys (NIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"}],"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\/08849451.pdf?arnumber=8849451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:34Z","timestamp":1773347674000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849451\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849451","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}