In this paper, we consider Byzantine attack identification problem in coded computing for distributed matrix multiplication tasks. We propose locally testable codes which facilitate the efficient ...

Abstract: In the light bulb problem, one is given as input vectors $x_{1}, \ldots, x_{n}, y_{1}, \ldots, y_{n} \in\{-1,1\}^{d}$ which are all uniformly random. They ...