Distributed Storage Codes Meet Multiple-Access Wiretap Channels
Dimitris S. Papailiopoulos, Alexandros G. Dimakis

TL;DR
This paper reveals a fundamental connection between minimizing repair overhead in MDS storage codes and maximizing secure degrees-of-freedom in multiple-access wiretap channels, both governed by interference alignment principles.
Contribution
It establishes a novel equivalence between storage repair overhead minimization and secure communication capacity maximization, providing a unified framework for code-channel mappings.
Findings
Optimal MDS codes correspond to full S-DoF channels.
Maximizing S-DoF is equivalent to minimizing repair overhead.
Framework for code-to-channel and channel-to-code mappings.
Abstract
We consider {\it i)} the overhead minimization of maximum-distance separable (MDS) storage codes for the repair of a single failed node and {\it ii)} the total secure degrees-of-freedom (S-DoF) maximization in a multiple-access compound wiretap channel. We show that the two problems are connected. Specifically, the overhead minimization for a single node failure of an {\it 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, we 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. 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
