Correcting adversarial errors with generalized regenerating codes
Loading...
Access rights
openAccess
acceptedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2024-02
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
13
Series
Advances in Mathematics of Communications, Volume 18, issue 1, pp. 128-140
Abstract
Traditional regenerating codes are efficient tools to optimize both storage and repair bandwidth in storing data across a distributed storage system, particularly in comparison to erasure codes and data replication. In traditional regenerating codes, the collection of any k nodes can reconstruct all stored information and is called the reconstruction set, N-R. A failed node can be regenerated from any d surviving nodes. These collections of d nodes are called the regeneration sets, N-H. The number of reconstruction sets and the number of regeneration sets satisfy vertical bar N-R vertical bar = C-n(k) and vertical bar N-H vertical bar = C-n-1(d). In generalized regenerating codes, we will have, 1Description
Keywords
Active omniscient adversary, generalized regenerating codes, fractional repetition code, resiliency capacity, DISTRIBUTED STORAGE-SYSTEMS, NETWORK
Other note
Citation
Karimi, N, Darani, A Y & Greferath, M 2024, ' Correcting adversarial errors with generalized regenerating codes ', Advances in Mathematics of Communications, vol. 18, no. 1, pp. 128-140 . https://doi.org/10.3934/amc.2022005