We provide novel coded computation strategies for distributed matrix-matrix products that
outperform the recent “Polynomial code” constructions in recovery threshold, ie, the required …

We consider the problem of secure distributed matrix multiplication (SDMM) in which a user
wishes to compute the product of two matrices with the assistance of honest but curious …

This paper has two main contributions. First, we propose a novel coding technique-
Generalized PolyDot-for matrix-vector products that advances on existing techniques for …

The goal of coded distributed computation is to efficiently distribute a computation task, such
as matrix multiplication, N-linear computation, or multivariate polynomial evaluation, across …

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 …

A secure multi-party batch matrix multiplication problem (SMBMM) is considered, where the
goal is to allow a master to efficiently compute the pairwise products of two batches of …

We consider the problem of secure distributed matrix multiplication (SDMM) in which a user
wishes to compute the product of two matrices with the assistance of honest but curious …

Edge computing is emerging as a new paradigm to allow processing data near the edge of
the network, where the data is typically generated and collected. This enables critical …

In recent years, edge computing has attracted significant attention because it can effectively
support many delay-sensitive applications. Despite such a salient feature, edge computing …

We consider the problem of secure distributed matrix multiplication in which a user wishes to
compute the product of two matrices with the assistance of honest but curious servers. In this …