Reconfiguring Array Codes

In this letter we consider array codes that are used for erasure protection in, e.g., wireless sensor networks. By treating the network as distributed storage with multiple sources, information can be exchanged between the nodes in the network allowing each node to store parity symbols relating to data from other nodes. We show how these array codes can be reconfigured to minimise the probability that some data symbols are not correctly exchanged (and therefore reducing the erasure correcting capability of the array code). We also present a suboptimal method for a class of array codes which significantly reduces the complexity of the reconfiguration while maintaining almost all of the performance.