{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:34:58Z","timestamp":1773930898943,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1617504"],"award-info":[{"award-number":["CCF-1617504"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1907053"],"award-info":[{"award-number":["CCF-1907053"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1731384"],"award-info":[{"award-number":["CNS-1731384"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-18-1-2057"],"award-info":[{"award-number":["N00014-18-1-2057"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"ARO","doi-asserted-by":"publisher","award":["W911NF-17-S-0002-03"],"award-info":[{"award-number":["W911NF-17-S-0002-03"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1109\/tit.2021.3064827","type":"journal-article","created":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T22:10:22Z","timestamp":1615327822000},"page":"2821-2846","source":"Crossref","is-referenced-by-count":54,"title":["Cross Subspace Alignment Codes for Coded Distributed Batch Computation"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8329-9911","authenticated-orcid":false,"given":"Zhuqing","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2038-2977","authenticated-orcid":false,"given":"Syed Ali","family":"Jafar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)90431-M"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(98)00091-1"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/0218045"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"ref31","article-title":"On the capacity of secure distributed matrix multiplication","author":"jia","year":"2019","journal-title":"arXiv 1908 06957"},{"key":"ref30","article-title":"Rate-efficiency and straggler-robustness through partition in distributed two-sided secure matrix computation","author":"kakar","year":"2018","journal-title":"arXiv 1810 13006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1988-0917825-9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/0908017"},{"key":"ref35","first-page":"12","article-title":"Trummer’s problem","volume":"17","author":"golub","year":"1985","journal-title":"Sigact News"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3013152"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3011053"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2908024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref1","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622429"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849317"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600894"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254170"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2916079"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3032196"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/280\/04619"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1994.1021"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(01)00378-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"ref12","article-title":"CodedSketch: A coding scheme for distributed computation of approximated matrix multiplication","author":"jahani-nezhad","year":"2018","journal-title":"arXiv 1812 10460"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref15","article-title":"Fundamental limits of coded linear transform","author":"wang","year":"2018","journal-title":"arXiv 1804 09791"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref17","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2877391"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437542"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref3","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 1811 10751"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref5","first-page":"1215","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"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(89)90302-6"},{"key":"ref9","first-page":"2100","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2779454"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/16M1102562"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2903206"},{"key":"ref47","article-title":"Private information retrieval from MDS coded databases with colluding servers under several variant models","author":"zhang","year":"2017","journal-title":"arXiv 1705 03186"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2689028"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2815607"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9409872\/9373383-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9409872\/09373383.pdf?arnumber=9373383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:14Z","timestamp":1652194454000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9373383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":53,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3064827","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}