Sign Up to like & get
recommendations!
0
Published in 2017 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2017.2695610
Abstract: This letter studies the performance of ensemble of Regenerating codes and Replication (RR). It theoretically analyzes the storage-bandwidth tradeoff curve of RR, and attains two extremal cases, corresponding to minimum storage cost RR (MSRR) and…
read more here.
Keywords:
regenerating codes;
ensemble regenerating;
repair bandwidth;
codes replication ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "IEEE Communications Letters"
DOI: 10.1109/lcomm.2022.3230263
Abstract: In distributed storage systems (DSS), an optimal code design must meet the requirements of efficient local data regeneration in addition to reliable data retention. Recently, low-density parity-check (LDPC) codes have been proposed as a promising…
read more here.
Keywords:
distributed storage;
ldpc codes;
ldpc;
storage systems ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2020 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.3008342
Abstract: We consider the problem of multiple-node repair in distributed storage systems under the cooperative model, where the repair bandwidth includes the amount of data exchanged between any two different storage nodes. Recently, explicit constructions of…
read more here.
Keywords:
node size;
model;
inline formula;
repair bandwidth ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2021 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.3036386
Abstract: In the literature, all the known high-rate MDS codes with the optimal repair bandwidth possess a significantly large sub-packetization level, which may prevent the codes to be implemented in practical systems. To build MDS codes…
read more here.
Keywords:
repair bandwidth;
packetization level;
sub packetization;
mds codes ... See more keywords