New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes
IEEE Transactions on Information Theory · 2024-03 · 70 (3) · 1806-1822
DOI: 10.1109/tit.2024.3353111 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2024-03. Verfasst von Weijun Fang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 41 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Natural Science Foundation of Shandong Province.
Abstract (Originalsprache)
MDS array codes have been extensively studied due to their applications in storage systems. In this paper, we first propose a novel method of constructing MDS array codes by deleting one row and one column from the circulant matrices associated to some polynomials. Several new classes of MDS array codes with flexible parameters are constructed. In particular, we give a new algebraic presentation of the Blaum-Roth codes with sparser parity-check matrices. We also obtain a family of MDS array codes over finite fields with even characteristics whose parity-check matrices have the lowest density. Furthermore, based on these new MDS array codes, we give a general construction of optimal locally repairable array codes (LRACs) achieving the Singleton-type bound. Additionally, we obtain some new optimal LRACs of long lengths. Finally, we present a scheduled algorithm for syndrome computations of binary optimal LRACs with redundancy 4, which can tolerate three failures. The number of XORs per data bit required in our algorithm approaches 2 as the length approaches infinity, which is the same as the MDS codes tolerating three failures. However, the number of nodes required during the repair of a failed node in our optimal LRACs is only about half of that in MDS array codes.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province
- Taishan Scholar Program of Shandong Province, Guangdong Basic and Applied Basic Research Foundation
- Shenzhen Science and Technology Program
Zitieren
APA
Fang, W., Lv, J., Chen, B., Xia, S., & Chen, X. (2024). New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes. IEEE Transactions on Information Theory, 70(3), 1806-1822. https://doi.org/10.1109/tit.2024.3353111
Vancouver
Fang W, Lv J, Chen B, Xia S, Chen X. New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes. IEEE Transactions on Information Theory. 2024;70(3):1806-1822. doi:10.1109/tit.2024.3353111
BibTeX
@article{Fang2024,
author = {Fang, Weijun and Lv, Jingjie and Chen, Bin and Xia, Shu-Tao and Chen, Xiangyu},
title = {New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes},
journal = {IEEE Transactions on Information Theory},
year = {2024},
volume = {70},
number = {3},
pages = {1806--1822},
doi = {10.1109/tit.2024.3353111}
}
EUVIMED