Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

DOI10.1109/TIT.2019.2924888MaRDI QIDQ5211540zbMATH OpenOpenAlexWikidataFDO

Authors Umberto Martínez-Peñas, Frank R. Kschischang

Publication date 28 January 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.11158

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: Locally repairable codes (LRCs) are considered with equal or unequal localities, local distances and local field sizes. An explicit two-layer architecture with a sum-rank outer code is obtained, having disjoint local groups and achieving maximal recoverability (MR) for all families of local linear codes (MDS or not) simultaneously, up to a specified maximum locality $r$. Furthermore, the local linear codes (thus the localities, local distances and local fields) can be efficiently and dynamically modified without global recoding or changes in architecture or outer code, while preserving the MR property, easily adapting to new configurations in storage or new hot and cold data. In addition, local groups and file components can be added, removed or updated without global recoding. The construction requires global fields of size roughly $g^r$, for $g$ local groups and maximum or specified locality $r$. For equal localities, these global fields are smaller than those of previous MR-LRCs when $rleqh$ (global parities). For unequal localities, they provide an exponential field size reduction on all previous best known MR-LRCs. For bounded localities and a large number of local groups, the global erasure-correction complexity of the given construction is comparable to that of Tamo-Barg codes or Reed-Solomon codes with local replication, while local repair is as efficient as for the Cartesian product of the local codes. Reed-Solomon codes with local replication and Cartesian products are recovered from the given construction when $r=1$ and $h=0$, respectively. The given construction can also be adapted to provide hierarchical MR-LRCs for all types of hierarchies and parameters. Finally, subextension subcodes and sum-rank alternant codes are introduced to obtain further exponential field size reductions, at the expense of lower information rates.

Cited in

(23)

• Codes in the sum-rank metric: fundamentals and applications
• The geometry of one-weight codes in the sum-rank metric
• Constructions of optimal rank-metric codes from automorphisms of rational function fields
• Theory of supports for linear codes endowed with the sum-rank metric
• Private information retrieval from locally repairable databases with colluding servers
• Codes for Distributed Storage
• Hamming and simplex codes for the sum-rank metric
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials
• Clay and product-matrix MSR codes with locality
• New constructions of MSRD codes
• Locally repairable codes with multiple repair sets based on packings of block size 4
• A construction of maximally recoverable codes
• On Singleton-type bound of locally repairable codes
• Rank-metric codes and their applications
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Systematic maximum sum rank codes
• Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes
• On information-theoretic secure multiparty computation with local repairability
• Anticodes in the sum-rank metric
• Sum-rank product codes and bounds on the minimum distance
• Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory
• Constructing Partial MDS Codes from Reducible Algebraic Curves

This page was built for publication: Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211540)