{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T11:10:55Z","timestamp":1778929855608,"version":"3.51.4"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001321","name":"National Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3135581","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T20:40:34Z","timestamp":1639514434000},"page":"167374-167388","source":"Crossref","is-referenced-by-count":1,"title":["Securely Straggler-Exploiting Coded Computation for Distributed Matrix Multiplication"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2802-2143","authenticated-orcid":false,"given":"Heecheol","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0270-2781","authenticated-orcid":false,"given":"Sangwoo","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6804-980X","authenticated-orcid":false,"given":"Jungwoo","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","article-title":"Fast evaluation and interpolation","author":"kung","year":"1973"},{"key":"ref31","article-title":"Efficient erasure decoding of Reed–Solomon codes","author":"didier","year":"2009","journal-title":"arXiv 0901 1886"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9322629"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031590"},{"key":"ref17","first-page":"4319","article-title":"Chebyshev polynomial codes: Task entanglement-based coding for distributed matrix multiplication","author":"hong","year":"2021","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"},{"key":"ref4","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2934436"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.1002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref8","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc 31th Annu Conf Neural Inf Process Syst (NIPS)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517789"},{"key":"ref20","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2975021"},{"key":"ref21","article-title":"Private and rateless adaptive coded matrix-vector multiplication","author":"bitar","year":"2019","journal-title":"arXiv 1909 12611"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989342"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2972166"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3032196"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09650882.pdf?arnumber=9650882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T21:10:30Z","timestamp":1648501830000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9650882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3135581","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}