{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:54Z","timestamp":1773377634264,"version":"3.50.1"},"reference-count":19,"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.8849811","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["Systematic Matrix Multiplication Codes"],"prefix":"10.1109","author":[{"given":"Haewon","family":"Jeong","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University"}]},{"given":"Yaoqing","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University"}]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref11","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2018"},{"key":"ref12","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref14","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref16","article-title":"Codedsketch: A coding scheme for distributed computation of approximated matrix multiplications","author":"jahani-nezhad","year":"2018"},{"key":"ref17","first-page":"160","article-title":"Hadamard, khatri-rao, kronecker and other matrix products","volume":"4","author":"liu","year":"2008","journal-title":"Int J Inf Syst Sci"},{"key":"ref18","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref4","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018"},{"key":"ref3","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437459"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447112"},{"key":"ref7","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70087-8_73"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2846601"}],"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\/08849811.pdf?arnumber=8849811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:42Z","timestamp":1773347682000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849811\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849811","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}