{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T04:48:43Z","timestamp":1747975723422},"reference-count":31,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,17]]},"DOI":"10.1109\/itw48936.2021.9611384","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T21:46:27Z","timestamp":1637703987000},"source":"Crossref","is-referenced-by-count":11,"title":["Price of Precision in Coded Distributed Matrix Multiplication: A Dimensional Analysis"],"prefix":"10.1109","author":[{"given":"Junge","family":"Wang","sequence":"first","affiliation":[]},{"given":"Zhuqing","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Syed A.","family":"Jafar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.07.006"},{"key":"ref30","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"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":"ref12","article-title":"Codedsketch: A coding scheme for distributed computation of approximated matrix multiplications","author":"jahani-nezhad","year":"2018","journal-title":"arXiv preprint arXiv 1812 11467"},{"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 preprint arXiv 1804 09023"},{"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":"International Conference on Machine Learning"},{"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":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2006447"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref27","first-page":"arxiv:2105.01973","article-title":"?-Approximate Coded Matrix Multiplication is Nearly Twice as Efficient as Exact Multiplication","author":"jeong","year":"2021","journal-title":"ArXiv e-prints"},{"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 1075"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2860981"},{"key":"ref5","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"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":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"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":"Advances in neural information processing systems"},{"key":"ref1","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems"},{"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\/JSAIT.2021.3052934"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"}],"event":{"name":"2021 IEEE Information Theory Workshop (ITW)","location":"Kanazawa, Japan","start":{"date-parts":[[2021,10,17]]},"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\/09611384.pdf?arnumber=9611384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:52:05Z","timestamp":1652201525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9611384\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,17]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/itw48936.2021.9611384","relation":{},"subject":[],"published":{"date-parts":[[2021,10,17]]}}}