CLAY AND PRODUCT-MATRIX MSR CODES WITH LOCALITY

被引：0

作者：

Gao, Minhan ^{[1
]}

Holzbaur, Lukas ^{[1
]}

Wachter-zeh, Antonia ^{[1
]}

机构：

[1] Tech Univ Munich, Inst Commun Engn, Munich, Germany

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2024年 / 18卷 / 05期

关键词：

Regenerating codes; MSR codes; locality; PMDS codes; local regeneration; PARTIAL MDS CODES; DISTRIBUTED STORAGE;

D O I：

10.3934/amc.2023002

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Regenerating codes and codes with locality address the efficiency of the node repair problem. While regeneration reduces the repair bandwidth, locality reduces the number of nodes required for the repair of a small number of nodes. This work considers the combination of minimum storage regen-erating codes, an optimal subclass of regenerating codes, and PMDS codes, a particularly strong type of code with locality. Two new constructions are proposed in this paper. The first construction decreases the subpacketization mu n from rn to r r for all considered parameters of PMDS codes, and the second one achieves a significantly lower subpacketization n - r - 1 when the global redundancy is s = 1.

引用

页码：1480 / 1491

页数：12

共 50 条

[31] Constructions of Optimal Codes With Hierarchical Locality [J].

Zhang, Guanghui ;

Liu, Hongwei .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (12) :7333-7340

[32] Erasure Correction and Locality of Hypergraph Codes [J].

Beemer, Allison ;

Mayer, Carolyn ;

Kelley, Christine A. .

CODING THEORY AND APPLICATIONS, ICMCTA 2017, 2017, 10495 :21-29

[33] An Exponential Lower Bound on the Sub-Packetization of MSR Codes [J].

Alrabiah, Omar ;

Guruswami, Venkatesan .

PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, :979-985

[34] Exact-Regenerating Codes between MBR and MSR Points [J].

Ernvall, Toni .

2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,

[35] ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair [J].

Guruswami, Venkatesan ;

Lokam, Satyanarayana V. ;

Jayaraman, Sai Vikneshwar Mani .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (11) :6749-6761

[36] Secure Regenerating Codes Using Linear MBR/MSR Codes and the All-or-Nothing Transform [J].

Kuwakado, Hidenori ;

Kurihara, Masazumi .

2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, :221-225

[37] Extended Product and Integrated Interleaved Codes [J].

Blaum, Mario ;

Hetzler, Steven R. .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (03) :1497-1513

[38] Locality of Some Optimal Ternary Linear Codes [J].

Yang, Ruipan ;

Li, Ruihu ;

Guo, Luobin ;

Fu, Qiang ;

Rao, Yi .

ADVANCES IN INFORMATION AND COMMUNICATION TECHNOLOGY, 2017, 107 :164-169

[39] Constructing MSR codes with subpacketization 2n/3 for k+1 helper nodes [J].

Li, Guodong ;

Wang, Ningning ;

Hu, Sihuang ;

Ye, Min .

2022 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT, 2022, :3120-3125

[40] MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes [J].

Li, Guodong ;

Wang, Ningning ;

Hu, Sihuang ;

Ye, Min .

2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, :807-812

← 1 2 3 4 5 →