Collaborative Decoding of Polynomial Codes for Distributed Computation

05/31/2019
by   Adarsh M. Subramaniam, et al.
0

We show that polynomial codes (and some related codes) used for distributed matrix multiplication are interleaved Reed-Solomon codes and, hence, can be collaboratively decoded. We consider a fault tolerant setup where t worker nodes return erroneous values. For an additive random Gaussian error model, we show that for all t < N-K, errors can be corrected with probability 1. Further, numerical results show that in the presence of additive errors, when L Reed-Solomon codes are collaboratively decoded, the numerical stability in recovering the error locator polynomial improves with increasing L.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/12/2019

Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication

We propose a class of codes called random Khatri-Rao-Product (RKRP) code...
research
02/07/2021

Coded Computing with Noise

Distributed computation is a framework used to break down a complex comp...
research
12/24/2018

GASP Codes for Secure Distributed Matrix Multiplication

We consider the problem of secure distributed matrix multiplication (SDM...
research
05/05/2023

Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication

We present Modular Polynomial (MP) Codes for Secure Distributed Matrix M...
research
04/20/2016

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

We prove that Alekhnovich's algorithm can be used for row reduction of s...
research
07/09/2019

Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes

In this paper we present a new algorithm for Polynomial Linear System So...
research
03/20/2019

Numerically Stable Polynomially Coded Computing

We study the numerical stability of polynomial based encoding methods, w...

Please sign up or login with your details

Forgot password? Click here to reset