ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair

DOI10.1109/TIT.2020.3023110MaRDI QIDQ5138853zbMATH OpenOpenAlexFDO

Authors Satyanarayana V. Lokam, Sai Vikneshwar Mani Jayaraman, Venkatesan Guruswami

Publication date 4 December 2020

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

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

zbMATH Keywords

epsilon-minimum storage regenerating codesexact regeneration of single code blockmaximum distance separable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: $epsilon$-Minimum Storage Regenerating ($epsilon$-MSR) codes form a special class of Maximum Distance Separable (MDS) codes, providing mechanisms for exact regeneration of a single code block in their codewords by downloading slighly sub-optimal amount of information from the remaining code blocks. The key advantage of these codes is a significantly lower sub-packetization that grows only logarithmically with the length of the code, while providing optimality in storage and error-correcting capacity. However, from an implementation point of view, these codes require each remaining code block to be available for the repair of any single code block. In this paper, we address this issue by constructing $epsilon$-MSR codes that can repair a failed code block by contacting a fewer number of available code blocks. When a code block fails, our repair procedure needs to contact a few compulsory code blocks and is free to choose any subset of available code blocks for the remaining choices. Further, our construction requiresa field size linear in code length and ensures load balancing among the contacted code blocks in terms of information downloaded from them for a single repair.

Cited in

(7)

• Functional repair codes: a view from projective geometry
• Codes Between MBR and MSR Points With Exact Repair Property
• Multilinear algebra for distributed storage
• Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
• New centralized multi-node repair schemes for distributed storage
• Explicit constructions of optimal vector locally repairable codes
• (1+)-optimal MDS codes: contacting any set of helper nodes smaller than n-1

This page was built for publication: ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair

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