Sign Up to like & get
recommendations!
1
Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2017.2777836
Abstract: This paper presents a proof of the existence of computationally fast probabilistic erasure codes at distance ∈ from being MDS, namely the decoding algorithm is able with high probability to reconstruct the n letter message…
read more here.
Keywords:
codes hierarchical;
erasure codes;
hierarchical bundle;
erasure ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2919830
Abstract: Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes with hierarchical locality (H-LRC codes) provides added flexibility…
read more here.
Keywords:
locality covering;
codes hierarchical;
covering maps;
lrc codes ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2022.3218280
Abstract: Locally repairable codes with hierarchical locality (H-LRCs) are designed to correct different numbers of erasures, which play a crucial role in large-scale distributed storage systems. In this paper, we construct three classes of $q$ -ary…
read more here.
Keywords:
hierarchical locality;
inline formula;
codes hierarchical;
tex math ... See more keywords