Binary Dispersed Array Codes for Distributed Storage Systems
IEEE Transactions on Information Theory · 2026-07 · 72 (7) · 4695-4709
DOI: 10.1109/tit.2026.3689964 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-07. Verfasst von Qin Huang und 2 weiteren Autor:innen. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
This paper proposes to construct binary array codes from nonbinary codes by binary matrix dispersion. Thanks to their low-density and quasi-cyclic generator matrices, these binary dispersed array codes (BDACs) enjoy low encoding complexity. Their reconstruction property is characterized through matrix transformation. Several explicit constructions of BDACs from minimum-bandwidth regenerating codes, piggybacking codes, and locally recoverable codes are presented, as well as their similar single-node repair strategies to their nonbinary counterparts.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Huang, Q., He, G., & Sun, F. (2026). Binary Dispersed Array Codes for Distributed Storage Systems. IEEE Transactions on Information Theory, 72(7), 4695-4709. https://doi.org/10.1109/tit.2026.3689964
Vancouver
Huang Q, He G, Sun F. Binary Dispersed Array Codes for Distributed Storage Systems. IEEE Transactions on Information Theory. 2026;72(7):4695-4709. doi:10.1109/tit.2026.3689964
BibTeX
@article{Huang2026,
author = {Huang, Qin and He, Guanchen and Sun, Fuqiang},
title = {Binary Dispersed Array Codes for Distributed Storage Systems},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {7},
pages = {4695--4709},
doi = {10.1109/tit.2026.3689964}
}
EUVIMED