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

06/08/2018
by   Katina Kralevska, et al.
0

An explicit construction of systematic MDS codes, called HashTag+ codes, with arbitrary sub-packetization level for all-node repair is proposed. It is shown that even for small sub-packetization levels, HashTag+ codes achieve the optimal MSR point for repair of any parity node, while the repair bandwidth for a single systematic node depends on the sub-packetization level. Compared to other codes in the literature, HashTag+ codes provide from 20 in the average amount of data accessed and transferred during repair.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2022

Two Piggybacking Codes with Flexible Sub-Packetization to Achieve Lower Repair Bandwidth

As a special class of array codes, (n,k,m) piggybacking codes are MDS co...
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
03/09/2018

Network Traffic Driven Storage Repair

Recently we constructed an explicit family of locally repairable and loc...
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
09/24/2017

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

This paper addresses the problem of constructing MDS codes that enable e...
research
07/21/2019

Multi-Layer Transformed MDS Codes with Optimal Repair Access and Low Sub-Packetization

An (n,k) maximum distance separable (MDS) code has optimal repair access...
research
05/19/2022

An Efficient Piggybacking Design Framework with Sub-packetization l≤ r for All-Node Repair

Piggybacking design has been widely applied in distributed storage syste...

Please sign up or login with your details

Forgot password? Click here to reset