{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:13:34Z","timestamp":1740100414989,"version":"3.37.3"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,17]],"date-time":"2021-10-17T00:00:00Z","timestamp":1634428800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"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":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611422","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["Squeezed Random Khatri-Rao Product Codes"],"prefix":"10.1109","author":[{"given":"Ruowan","family":"Ji","sequence":"first","affiliation":[]},{"given":"Asit Kumar","family":"Pradhan","sequence":"additional","affiliation":[]},{"given":"Anoosheh","family":"Heidarzadeh","sequence":"additional","affiliation":[]},{"given":"Krishna R.","family":"Narayanan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852225"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70087-8_73"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/78.942615"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0609045"},{"key":"ref16","first-page":"arxiv?1904","article-title":"Slack squeeze coded computing for adaptive straggler mitigation","author":"giri narra","year":"2019","journal-title":"ArXiv e-prints"},{"key":"ref17","article-title":"Random convolutional coding for robust and straggler resilient distributed matrix computation","author":"das","year":"2019","journal-title":"ArXiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref19","article-title":"Bivariate polynomial coding for exploiting stragglers in heterogeneous coded computing systems","author":"hasircioglu","year":"2020","journal-title":"arXiv preprint arXiv 2001 04786"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref3","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2018","journal-title":"arXiv l705 10464"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref5","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":"ref8","article-title":"Speeding up distributed machine learning using codes","author":"lee","year":"2015","journal-title":"arXiv 1512 02673"},{"key":"ref7","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018","journal-title":"arXiv 1806 00939"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031590"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref9","article-title":"short-dot”: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2017","journal-title":"arXiv l704 05181"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036763"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2940895"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2021,10,17]]},"location":"Kanazawa, Japan","end":{"date-parts":[[2021,10,21]]}},"container-title":["2021 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9611366\/9611357\/09611422.pdf?arnumber=9611422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:04Z","timestamp":1652201524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611422\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611422","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}