{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:11Z","timestamp":1773376811529,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206571","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1967-1972","source":"Crossref","is-referenced-by-count":3,"title":["Access-Redundancy Tradeoffs in Quantized Linear Computations"],"prefix":"10.1109","author":[{"given":"Vinayak","family":"Ramkumar","sequence":"first","affiliation":[{"name":"Tel Aviv University,Department of Electrical Engineering&#x2013;Systems,Tel Aviv,Israel"}]},{"given":"Netanel","family":"Raviv","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis,Department of Computer Science and Engineering,St. Louis,MO,USA"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel Aviv University,Department of Electrical Engineering&#x2013;Systems,Tel Aviv,Israel"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834464"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206571"},{"key":"ref15","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":"ref14","first-page":"8880","article-title":"Enhancing robustness of neural networks through fourier stabilization","author":"raviv","year":"2021","journal-title":"International Conference on Machine Learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81645-2_25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.11"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057227"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73848"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.45285"},{"key":"ref7","first-page":"1782","article-title":"Efficient exact verification of binarized neural networks","volume":"33","author":"jia","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref9","first-page":"20","article-title":"Tight bounds for the partial-sums problem","volume":"4","author":"patrascu","year":"2004","journal-title":"SODA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/322290.322305"},{"key":"ref3","article-title":"Covering codes","author":"cohen","year":"2005","journal-title":"North-Holland Mathematical Library"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.737680"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057039"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206571.pdf?arnumber=10206571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:29Z","timestamp":1773347309000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206571\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206571","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}