{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:58:47Z","timestamp":1778605127252,"version":"3.51.4"},"reference-count":11,"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.8849395","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"3022-3026","source":"Crossref","is-referenced-by-count":33,"title":["Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach"],"prefix":"10.1109","author":[{"given":"Anindya B.","family":"Das","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":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, 50010, U.S.A"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref3","article-title":"Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication","author":"mallick","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2880213"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1090\/spec\/002","author":"acton","year":"1990","journal-title":"Numerical Methods That (Usually) Work"},{"key":"ref11","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.45283"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502417715"},{"key":"ref2","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc of Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref1","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 Advances in Neural Information Processing Systems (NIPS)"}],"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\/08849395.pdf?arnumber=8849395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:10Z","timestamp":1773347710000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849395\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849395","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}