Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, the authors outline an approach to the task of designing network codes in a non-multicast setting. Their approach makes use of the concept of interference alignment. As an example, they consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.