.png){kind=icon}
.png){kind=icon}
Return
Optimal array codes with hierarchical locality
.png){kind=icon}
PRE
AI
DOI：10.1007/s12095-025-00855-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we introduce two-level hierarchical locally repairable array codes (H-LRACs), a new class of codes designed to improve storage efficiency and fault tolerance in distributed storage systems. Firstly, we leverage the strengths of locally repairable codes (LRCs) and array codes to construct optimal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{(r,\delta )}$$\end{document}-LRACs with long code lengths. Then we introduce the concept of array codes with hierarchical locality, which offer a higher level of data protection through a multi-level locality structure. A key contribution of this paper is that we derive a universal upper bound on the minimum distance of H-LRACs using an entropy-based approach. This bound is shown to be tight through the explicit constructions for H-LRACs, capitalizing on optimal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{(r,\delta )}$$\end{document}-LRAC constructions. Finally, we extend the bound to LRACs with an arbitrary level of hierarchical locality.
Keywords:
Locally repairable array codes
Hierarchical locality
Singleton-type bound
Parity-check matrix
Journal
C
IF:
1.1
Papers:
63
Citations:
0