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

被引：0

作者：

Kralevska, Katina ^{[1
]}

Gligoroski, Danilo ^{[1
]}

机构：

[1] Norwegian Univ Sci & Technol, NTNU, Dept Informat Secur & Commun Technol, Trondheim, Norway

来源：

2018 16TH IEEE INT CONF ON DEPENDABLE, AUTONOM AND SECURE COMP, 16TH IEEE INT CONF ON PERVAS INTELLIGENCE AND COMP, 4TH IEEE INT CONF ON BIG DATA INTELLIGENCE AND COMP, 3RD IEEE CYBER SCI AND TECHNOL CONGRESS (DASC/PICOM/DATACOM/CYBERSCITECH) | 2018年

关键词：

Explicit; systematic; MDS; MSR; small sub-packetization; all-node repair; access-optimal;

D O I：

10.1109/DASC/PiCom/DataCom/CyberSciTec.2018.00066

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：1080 / 1084

页数：5