{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:33Z","timestamp":1773377973414,"version":"3.50.1"},"reference-count":19,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["CCF-1718470,CCF-1910840"],"award-info":[{"award-number":["CCF-1718470,CCF-1910840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518108","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1724-1729","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and Robust Distributed Matrix Computations via Convolutional Coding"],"prefix":"10.1109","author":[{"given":"Anindya Bijoy","family":"Das","sequence":"first","affiliation":[{"name":"Iowa State University,Electrical and Computer Engineering,Ames,IA,USA,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[{"name":"Iowa State University,Electrical and Computer Engineering,Ames,IA,USA,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Namrata","family":"Vaswani","sequence":"additional","affiliation":[{"name":"Iowa State University,Electrical and Computer Engineering,Ames,IA,USA,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849468"},{"key":"ref11","author":"ramamoorthy","year":"2019","journal-title":"Numerically stable coded matrix computations via circulant and rotation matrix embeddings"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref13","author":"lin","year":"2004","journal-title":"Error Control Coding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/0100000006"},{"key":"ref15","author":"das","year":"2020","journal-title":"Efficient and robust distributed matrix computations via convolutional coding"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1969.12000359"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/9781108277587"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.915697"},{"key":"ref19","year":"0","journal-title":"Straggler mitigation codes"},{"key":"ref4","first-page":"4403","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"0","journal-title":"Proc of Adv in Neur Inf Proc Syst (NIPS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref8","article-title":"Coded sparse matrix multiplication","author":"wang","year":"0","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/15M1030170"}],"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\/09518108.pdf?arnumber=9518108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:44Z","timestamp":1773347744000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518108","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}