MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth

09/24/2017
by   Ankit Singh Rawat, et al.
0

This paper addresses the problem of constructing MDS codes that enable exact repair of each code block with small repair bandwidth, which refers to the total amount of information flow from the remaining code blocks during the repair process. This problem naturally arises in the context of distributed storage systems as the node repair problem [7]. The constructions of exact-repairable MDS codes with optimal repair-bandwidth require working with large sub-packetization levels, which restricts their employment in practice. This paper presents constructions for MDS codes that simultaneously provide both small repair bandwidth and small sub-packetization level. In particular, this paper presents two general approaches to construct exact-repairable MDS codes that aim at significantly reducing the required sub-packetization level at the cost of slightly sub-optimal repair bandwidth. The first approach gives MDS codes that have repair bandwidth at most twice the optimal repair-bandwidth. Additionally, these codes also have the smallest possible sub-packetization level ℓ = O(r), where r denotes the number of parity blocks. This approach is then generalized to design codes that have their repair bandwidth approaching the optimal repair-bandwidth at the cost of graceful increment in the required sub-packetization level. The second approach transforms an MDS code with optimal repair-bandwidth and large sub-packetization level into a longer MDS code with small sub-packetization level and near-optimal repair bandwidth. For a given r, the obtained codes have their sub-packetization level scaling logarithmically with the code length. In addition, the obtained codes require field size only linear in the code length and ensure load balancing among the intact code blocks in terms of the information downloaded from these blocks during the exact reconstruction of a code block.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2019

A Systematic Construction of MDS Codes with Small Sub-packetization Level and Near Optimal Repair Bandwidth

In the literature, all the known high-rate MDS codes with the optimal re...
research
07/03/2018

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

ϵ-Minimum Storage Regenerating (ϵ-MSR) codes form a special class of Max...
research
07/09/2019

Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization

Minimum storage regenerating (MSR) codes are MDS codes which allow for r...
research
06/08/2018

An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair

An explicit construction of systematic MDS codes, called HashTag+ codes,...
research
05/29/2022

Two New Piggybacking Designs with Lower Repair Bandwidth

Piggybacking codes are a special class of MDS array codes that can achie...
research
11/10/2021

Rectangular, Range, and Restricted AONTs: Three Generalizations of All-or-Nothing Transforms

All-or-nothing transforms (AONTs) were originally defined by Rivest as b...
research
01/18/2019

A Note on the Transformation to Enable Optimal Repair in MDS Codes for Distributed Storage Systems

For high-rate maximum distance separable (MDS) codes, most early constru...

Please sign up or login with your details

Forgot password? Click here to reset