Binary MDS Array Codes with Optimal Repair
share
Consider a binary maximum distance separate (MDS) array code composed of an m× (k+r) array of bits with k information columns and r parity columns, such that any k out of k+r columns suffice to reconstruct the k information columns. Our goal is to provide optimal repair access for binary MDS array codes, meaning that the bandwidth triggered to repair any single failed information or parity column is minimized. In this paper, we propose a generic transformation framework for binary MDS array codes, using EVENODD codes as a motivating example, to support optimal repair access for k+1< d < k+r-1, where d denotes the number of non-failed columns that are connected for repair. In addition, we show that the efficient decoding property of the original EVENODD codes is maintained after transformation. Furthermore, we show how our transformation framework applies to general binary MDS array codes and enables them to support optimal repair access.
READ FULL TEXT