{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:46:06Z","timestamp":1775745966810,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"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","award":["CCF-1718470"],"award-info":[{"award-number":["CCF-1718470"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1910840"],"award-info":[{"award-number":["CCF-1910840"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/tit.2021.3137266","type":"journal-article","created":{"date-parts":[[2021,12,21]],"date-time":"2021-12-21T21:07:05Z","timestamp":1640120825000},"page":"2684-2703","source":"Crossref","is-referenced-by-count":22,"title":["Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-1271","authenticated-orcid":false,"given":"Aditya","family":"Ramamoorthy","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0796-3160","authenticated-orcid":false,"given":"Li","family":"Tang","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, IA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974149"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718027"},{"key":"ref6","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Proc. Syst. (NIPS)","author":"Yu"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/78.365287"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/15m1030170"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2880213"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613321"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849395"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3095909"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919859"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152827"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611400"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1561\/0100000006"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371"},{"key":"ref21","volume-title":"Github Repository for Computing Matrix Inverse Over Prime Order Finite Field","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref23","volume-title":"Repository of Numerically Stable Coded Matrix Computations Via Circulant and Rotation Matrix Embeddings","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502417715"},{"key":"ref25","volume-title":"TR-2013003: Polynomial evaluation and interpolation: Fast and stable approximate solution","author":"Pan","year":"2013"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9737657\/9656928-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9737657\/09656928.pdf?arnumber=9656928","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:40:42Z","timestamp":1704847242000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9656928\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":25,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2021.3137266","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}