Back to Search
Start Over
Constructions of Optimal Codes With Hierarchical Locality.
- Source :
-
IEEE Transactions on Information Theory . Dec2020, Vol. 66 Issue 12, p7333-7340. 8p. - Publication Year :
- 2020
-
Abstract
- Locally repairable codes (LRCs) and codes with hierarchical locality (H-LRCs) have a great significance due to their applications in distributed storage systems. Constructing LRCs or H-LRCs achieving the Singleton-type bound is a challenging task and has received much attention. In this paper, we make use of optimal LRCs to construct a family of optimal H-LRCs. For this purpose we first construct a new class of optimal LRCs via generalized Reed-Solomon codes (GRS codes). Next, based on these optimal LRCs we present some new optimal H-LRCs, of which the parameters are more flexible than those given in and. [ABSTRACT FROM AUTHOR]
- Subjects :
- *LINEAR codes
*REED-Muller codes
*REED-Solomon codes
*TASK analysis
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 66
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 147291909
- Full Text :
- https://doi.org/10.1109/TIT.2020.2977636