Determinant Codes With Helper-Independent Repair for Single and Multiple Failures

DOI10.1109/TIT.2019.2904294MaRDI QIDQ5211380zbMATH OpenOpenAlexWikidataFDO

Authors Mehran Elyasi, S. Mohajer

Publication date 28 January 2020

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

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

zbMATH Keywords

determinant codesexact-repair regenerating codes for distributed storage systems

Mathematics Subject Classification ID

Source coding (94A29) Other types of codes (94B60)

Abstract: Determinant codes are a class of exact-repair regenerating codes for distributed storage systems with parameters (n, k = d, d). These codes cover the entire trade-off between per-node storage and repair-bandwidth. In an earlier work of the authors, the repair data of the determinant code sent by a helper node to repair a failed node depends on the identity of the other helper nodes participating in the process, which is practically undesired. In this work, a new repair mechanism is proposed for determinant codes, which relaxes this dependency, while preserving all other properties of the code. Moreover, it is shown that the determinant codes are capable of repairing multiple failures, with a per-node repair-bandwidth which scales sub-linearly with the number of failures.

Recommendations

• Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
• Repairing Multiple Failures for Scalar MDS Codes
• On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
• Repairing Reed-Solomon Codes With Multiple Erasures
• Repairing multiple failures for algebraic geometry codes
• Locally Repairable Codes: Joint Sequential–Parallel Repair for Multiple Node Failures
• Optimal codes for correcting single errors and detecting adjacent errors
• Optimal codes for single-error correction, double-adjacent-error detection
• The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
• Repair Optimal Erasure Codes Through Hadamard Designs

Cited in

(3)

• Multilinear algebra for distributed storage
• Codes for Distributed Storage
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction

This page was built for publication: Determinant Codes With Helper-Independent Repair for Single and Multiple Failures

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