Distributed Storage Codes Meet Multiple-Access Wiretap Channels
The authors consider the overhead minimization of Maximum-Distance Separable (MDS) storage codes for the repair of a single failed node and the total Secure Degrees-of-Freedom (S-DoF) maximization in a multiple-access compound wiretap channel. They show that the two problems are connected. Specifically, the overhead minimization for a single node failure of an optimal MDS code, i.e. one that can achieve the information theoretic overhead minimum, is equivalent to maximizing the S-DoF in a multiple-access compound wiretap channel. Additionally, they show that maximizing the S-DoF in a multiple access compound wiretap channel is equivalent to minimizing the overhead of an MDS code for the repair of a departed node.