Distributed Storage Codes Meet Multiple-Access Wiretap Channels

We consider i) the overhead minimization of maximum-distance seperable (MDS) storage codes for the repair of a single failed node and ii) the total secure degrees-of-freedom (S-DoF) maximization in a multiple-access compound wiretap channel. We show that the two problems are formally 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, reduces to maximizing the S-DoF in a multiple-access compound wiretap channel. Additionally, we show that maximizing the S-DoF in a multiple-access compound wiretap channel reduces to minimizing the overhead of an MDS code for the repair of a departed node. An optimal MDS code maps to a full S-DoF channel and a full S-DoF channel maps to an MDS code with minimum repair overhead for one failed node. We also state a general framework for code-to-channel and channel-to-code mappings and performance bounds between the two settings. The underl...

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Dimitris S. Papailiopoulos, Alexandros G. Dimakis
• Keywords: Compound Wiretap Channel, CORR 2010, Education, Multiple-access Compound Wiretap, Overhead Minimization