Fig. 2From: Private and rateless adaptive coded matrix-vector multiplicationComparison between PRAC, Staircase codes and GC3P in scenario 1 for different values of the number workers and number of colluding workers. We fix the number of rows to \(m=1000\). For each value of the x-axis we run 100 experiments and average the results. We observe that the difference between the completion time of PRAC and this of GC3P is large for small values of \(n-z\) and decreases with the increase of \(n-z\)Back to article page