{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:32Z","timestamp":1773376592333,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009950","name":"Ministry of Education","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009950","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206996","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2183-2188","source":"Crossref","is-referenced-by-count":2,"title":["Coded matrix computation with gradient coding"],"prefix":"10.1109","author":[{"given":"Kyungrak","family":"Son","sequence":"first","affiliation":[{"name":"Seoul National University,Institute of New Media and Communications,Seoul,South Korea,08826"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[{"name":"Iowa State University,Dept. of Electrical and Computer Eng.,Ames,IA,U.S.A.,50011"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2021.3117510"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206996"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3182221"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref22","article-title":"Numerically stable binary coded computations","author":"charalambides","year":"2021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3137266"},{"key":"ref21","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3186908"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref18","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc of Intl Conf on Machine Learning (ICML)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref3","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 Neur Inf Proc Syst (NIPS)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974149"},{"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 Neur Inf Proc Syst (NIPS)"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206996.pdf?arnumber=10206996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:44Z","timestamp":1773347204000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206996\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206996","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}