Showing cs.ITShow all
3 papers · 1 filter
cs.IT2019
Numerically Stable Polynomially Coded Computing
Mohammad Fahim, Viveck R. Cadambe
We study the numerical stability of polynomial based encoding methods, which has emerged to be a powerful class of techniques for providing straggler and fault tolerance in the are…
cs.IT2018
On the Optimal Recovery Threshold of Coded Matrix Multiplication
Sanghamitra Dutta, Mohammad Fahim, Farzin Haddadpour +3
We provide novel coded computation strategies for distributed matrix-matrix products that outperform the recent "Polynomial code" constructions in recovery threshold, i.e., the req…
cs.IT2017
Linear Network Coding for Two-Unicast- Networks: A Commutative Algebraic Perspective and Fundamental Limits
Mohammad Fahim, Viveck Cadambe
We consider a two-unicast- network over a directed acyclic graph of unit capacitated edges; the two-unicast- network is a special case of two-unicast networks where one of th…