Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Optimal Recovery Threshold of Coded Matrix Multiplication   We provide novel coded computation strategies for distributed matrix-matrix
products that outperform the recent "Polynomial code" constructions in recovery
threshold, i.e., the required number of successful workers. When $m$-th
fraction of each matrix can be stored in each worker node, Polynomial codes
require $m^2$ successful workers, while our MatDot codes only require $2m-1$
successful workers, albeit at a higher communication cost from each worker to
the fusion node. We also provide a systematic construction of MatDot codes.
Further, we propose "PolyDot" coding that interpolates between Polynomial codes
and MatDot codes to trade off communication cost and recovery threshold.
Finally, we demonstrate a coding technique for multiplying $n$ matrices ($n
\geq 3$) by applying MatDot and PolyDot coding ideas.

19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
25
The categories of this paper are: patt-sol
5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an