{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:24Z","timestamp":1773377664457,"version":"3.50.1"},"reference-count":15,"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.8849606","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1092-1096","source":"Crossref","is-referenced-by-count":27,"title":["Distributed and Private Coded Matrix Computation with Flexible Communication Load"],"prefix":"10.1109","author":[{"given":"Malihe","family":"Aliasgari","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osvaldo","family":"Simeone","sequence":"additional","affiliation":[{"name":"Department of Informatics, King’s College London, London, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"GASP codes for secure distributed matrix multiplication","author":"d\u2019oliveira","year":"2018","journal-title":"arXiv preprint arXiv 1812 02588"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref13","article-title":"On the optimal recovery threshold of coded matrix multiplication","author":"dutta","year":"2018","journal-title":"Arxiv preprint arXiv 1801 10588"},{"key":"ref14","article-title":"A unified coded deep neural network training strategy based on generalized polydot codes for matrix multiplication","author":"dutta","year":"2018","journal-title":"arXiv preprint arXiv 1811 10751"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"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"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869791"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2018.8647313"},{"key":"ref7","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv preprint arXiv 1806 00939"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3055281"},{"key":"ref1","article-title":"Beating the perils of non-convexity: Guaranteed training of neural networks using tensor methods","author":"janzamin","year":"2015","journal-title":"arXiv preprint arXiv 1506 03857"},{"key":"ref9","article-title":"Rate-efficiency and stragglerrobustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"2018","journal-title":"arXiv preprint arXiv 1810 10053"}],"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\/08849606.pdf?arnumber=8849606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:47Z","timestamp":1773347687000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849606\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849606","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}