An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair
Information Theory
2020-02-14 v2 Distributed, Parallel, and Cluster Computing
math.IT
Abstract
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% to 40% savings in the average amount of data accessed and transferred during repair.
Keywords
Cite
@article{arxiv.1806.03103,
title = {An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair},
author = {Katina Kralevska and Danilo Gligoroski},
journal= {arXiv preprint arXiv:1806.03103},
year = {2020}
}