11 citations · 11 across the 2 of their papers we have counts for
5 papers · 1 filter
Matrix Completion over Finite Fields: Bounds and Belief Propagation Algorithms
Mahdi Soleymani, Qiang Liu, Hessam Mahdavifar +1
We consider the low rank matrix completion problem over finite fields. This problem has been extensively studied in the domain of real/complex numbers, however, to the best of auth…
Coded Computing via Binary Linear Codes: Designs and Performance Limits
Mahdi Soleymani, Mohammad Vahid Jamali, Hessam Mahdavifar
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into smaller tasks, encoded using an…
List-Decodable Coded Computing: Breaking the Adversarial Toleration Barrier
Mahdi Soleymani, Ramy E. Ali, Hessam Mahdavifar +1
We consider the problem of coded computing, where a computational task is performed in a distributed fashion in the presence of adversarial workers. We propose techniques to break…
Analog Lagrange Coded Computing
Mahdi Soleymani, Hessam Mahdavifar, A. Salman Avestimehr
A distributed computing scenario is considered, where the computational power of a set of worker nodes is used to perform a certain computation task over a dataset that is disperse…
Coded Distributed Computing: Performance Limits and Code Designs
Mohammad Vahid Jamali, Mahdi Soleymani, Hessam Mahdavifar
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into smaller tasks, encoded using an…