Binary MDS Array Codes With Optimal Repair

DOI10.1109/TIT.2019.2939111MaRDI QIDQ5123794zbMATH OpenOpenAlexFDO

Authors Hanxu Hou, Patrick P. C. Lee

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.04380

zbMATH Keywords

binary maximum distance separable (MDS) array code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: Consider a binary maximum distance separable (MDS) array code composed of an $mimes(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+1ledlek+r-1$, where $d$ denotes the number of non-failed columns that are connected for repair; note that when $d<k+r-1$, some of the chosen $d$ columns in repairing a failed column are specific. In addition, we show how our transformation framework applies to an example of binary MDS array codes with asymptotically optimal repair access of any single information column and enables asymptotically or exactly optimal repair access for any column. Furthermore, we present a new transformation for EVENODD codes with two parity columns such that the existing efficient repair property of any information column is preserved and the repair access of parity column is optimal.

Recommendations

• A New Design of Binary MDS Array Codes With Asymptotically Weak-Optimal Repair
• Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
• Improved Schemes for Asymptotically Optimal Repair of MDS Codes
• Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
• Optimal Rebuilding of Multiple Erasures in MDS Codes
• Repairing Multiple Failures for Scalar MDS Codes
• MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
• MDS code constructions with small sub-packetization and near-optimal repair bandwidth
• Exact-Repair MDS Code Construction Using Interference Alignment
• Zigzag Codes: MDS Array Codes With Optimal Rebuilding

Cited in

(6)

• Codes Between MBR and MSR Points With Exact Repair Property
• Zigzag Codes: MDS Array Codes With Optimal Rebuilding
• MDS array codes for correcting a single criss-cross error
• Modified Low-Density MDS Array Codes for Tolerating Double Disk Failures in Disk Arrays
• Construction of binary cooperative MSR codes with multiple repair degrees
• (1+)-optimal MDS codes: contacting any set of helper nodes smaller than n-1

This page was built for publication: Binary MDS Array Codes With Optimal Repair

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5123794)