Clay and Product-Matrix MSR Codes with Locality
- 1 January 2023
- journal article
- research article
- Published by American Institute of Mathematical Sciences (AIMS) in Advances in Mathematics of Communications
- Vol. 18 (5) , 1480-1491
Abstract
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 regenerating 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 from $ r^n $ to $ r^{\frac{\mu n}{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 $.
Keywords
This publication has 14 references indexed in Scilit:
- Repair Duality with Locally Repairable and Locally Regenerating Codes2017
- Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair BandwidthIEEE Transactions on Information Theory, 2017
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity SymbolsIEEE Transactions on Information Theory, 2016
- Codes With Local Regeneration and Erasure CorrectionIEEE Transactions on Information Theory, 2014
- On the minimum storage overhead of distributed storage codes with a given repair locality2014
- Secure Cooperative Regenerating Codes for Distributed Storage SystemsIEEE Transactions on Information Theory, 2014
- Partial-MDS Codes and Their Application to RAID Type of ArchitecturesIEEE Transactions on Information Theory, 2013
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed StorageIEEE Transactions on Information Theory, 2013
- On the Locality of Codeword SymbolsIEEE Transactions on Information Theory, 2012
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix ConstructionIEEE Transactions on Information Theory, 2011