2018/09/12 by Hanxu Hou, Hou, Hanxu, Patrick P. C. Lee +1 · 1 citation
Computer Science · #Advanced Data Storage Technologies #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1809.04380
openalex publication_date 2018/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Consider a binary maximum distance separable (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 \em 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; note that when d