2013/02/17 by Eyal En Gad, Robert Mateescu, Gad, Eyal En +7
Computer Science · #Advanced Data Storage Technologies #Cellular Automata and Applications #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1302.4129
openalex publication_date 2013/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Maximum-distance separable (MDS) array codes with high rate and an optimal repair property were introduced recently. These codes could be applied in distributed storage systems, where they minimize the communication and disk access required for the recovery of failed nodes. However, the encoding and decoding algorithms of the proposed codes use arithmetic over finite fields of order greater than 2, which could result in a complex implementation. In this work, we present a construction of 2-parity MDS array codes, that allow for optimal repair of a failed information node using XOR operations only. The reduction of the field order is achieved by allowing more parity bits to be updated when a single information bit is being changed by the user.