Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2022 at "IEEE Access"
DOI: 10.1109/access.2022.3143899
Abstract: The importance of Locally Repairable Codes (LRCs) lies on their applications in distributed storage systems (DSSs). There are two approaches to repair multiple failed nodes: the parallel approach, in which a set of failed nodes…
read more here.
Keywords:
permutation cubes;
latin squares;
repairable codes;
locally repairable ... See more keywords
Photo from academic.microsoft.com
Sign Up to like & get
recommendations!
0
Published in 2018 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2018.2827053
Abstract: Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems (DSSs) such as Microsoft Azure Storage and Facebook HDFS-RAID (Hadoop Distributed File System-Redundant Array of Independent Disks). Since information in…
read more here.
Keywords:
repairable codes;
locally repairable;
update complexity;
improving update ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "IEEE Transactions on Communications"
DOI: 10.1109/tcomm.2020.3005430
Abstract: Multipartite secret sharing is an important research object in the area of secret sharing schemes. Compartmented access structures are an interesting class of multipartite access structures. The constructions of ideal linear schemes realizing compartmented access…
read more here.
Keywords:
compartmented access;
locally repairable;
secret sharing;
sharing schemes ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2911595
Abstract: Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by accessing only a few others. Several…
read more here.
Keywords:
residual codes;
bound;
locally repairable;
locality ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2020 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2019.2946627
Abstract: Locally repairable codes with more than one recovering set are demanded in the application to distributed storage. For each failure node (or disk), it is desired to have as many recovering sets as possible. In…
read more here.
Keywords:
recovering sets;
multiple recovering;
locally repairable;
function fields ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2021 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.3041475
Abstract: In this work it is shown that locally repairable codes (LRCs) can be list-decoded efficiently beyond the Johnson radius for a large range of parameters by utilizing the local error-correction capabilities. The corresponding decoding radius…
read more here.
Keywords:
repairable partial;
partial mds;
locally repairable;
error decoding ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2022 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2021.3131003
Abstract: New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $F$ . The bounds apply to LRCs…
read more here.
Keywords:
tex math;
inline formula;
repairable codes;
rate ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2022.3203591
Abstract: Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,\delta)$ -locality that achieve equality in the Singleton-type bound. We use…
read more here.
Keywords:
inline formula;
locally repairable;
tex math;