{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T04:47:30Z","timestamp":1747975650651,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437542","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1625-1629","source":"Crossref","is-referenced-by-count":20,"title":["Codes for Distributed Finite Alphabet Matrix-Vector Multiplication"],"prefix":"10.1109","author":[{"given":"Farzin","family":"Haddadpour","sequence":"first","affiliation":[]},{"given":"Viveck R.","family":"Cadambe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"journal-title":"A fast noniterative algorithm for compressive sensing using binary measurement matrices","year":"2017","author":"mahsa","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2502541"},{"journal-title":"GB-PANDAS Throughput and heavy-tra ic optimality analysis for affinity scheduling","year":"2017","author":"yekkehkhany","key":"ref14"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"ref15"},{"year":"0","key":"ref16"},{"journal-title":"Numerical Analysis Using Sage","year":"0","author":"anastassiou","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.09.028"},{"key":"ref19","volume":"2","author":"brent","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref3","first-page":"2092","article-title":"Short-Dot: Computing Large Linear Transforms Distributedly Using Coded Short Dot Products","author":"dutta","year":"2016","journal-title":"NIPS"},{"journal-title":"Approximate Gradient Coding via Sparse Random Graphs","year":"0","author":"charles","key":"ref6"},{"journal-title":"Gradient coding from cyclic MDS codes and expander graphs","year":"2017","author":"raviv","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262882"},{"key":"ref7","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref2","article-title":"Speeding Up Distributed Machine Learning Using Codes","author":"lee","year":"2015","journal-title":"NIPS Workshop on Learning Systems"},{"key":"ref1","first-page":"518","volume":"100","author":"huang","year":"1984","journal-title":"Algorithm-based fault tolerance for matrix operations"},{"journal-title":"On the Optimal Recovery Threshold of Coded Matrix Multiplication","year":"2018","author":"dutta","key":"ref9"},{"journal-title":"Codes for Distributed Finite Alphabet Matrix-Vector Multiplication","year":"0","author":"haddadpour","key":"ref20"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437542.pdf?arnumber=8437542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:26:45Z","timestamp":1598221605000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437542","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}