Results 1 to 10 of about 2,942 (253)

Locally Repairable Codes [PDF]

open access: yes2012 IEEE International Symposium on Information Theory Proceedings, 2014
Distributed storage systems for large-scale applications typically use replication for reliability. Recently, erasure codes were used to reduce the large storage overhead, while increasing data reliability.
Dimakis, Alexandros G.   +1 more
core   +3 more sources

Balanced Locally Repairable Codes [PDF]

open access: yes2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2016
We introduce a family of balanced locally repairable codes (BLRCs) $[n, k, d]$ for arbitrary values of $n$, $k$ and $d$. Similar to other locally repairable codes (LRCs), the presented codes are suitable for applications that require a low repair ...
Gligoroski, Danilo   +2 more
core   +2 more sources

Local Codes with Addition Based Repair [PDF]

open access: yes2015 IEEE Information Theory Workshop - Fall (ITW), 2015
We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or codes with addition based repair.
Dau, Son Hoang   +3 more
core   +2 more sources

Locally Repairable Codes with Multiple Repair Alternatives [PDF]

open access: yes2013 IEEE International Symposium on Information Theory, 2013
Distributed storage systems need to store data redundantly in order to provide some fault-tolerance and guarantee system reliability. Different coding techniques have been proposed to provide the required redundancy more efficiently than traditional ...
Hollmann, Henk D. L.   +2 more
core   +2 more sources

New Binary Locally Repairable Codes with Locality 2 and Uneven Availabilities for Hot Data [PDF]

open access: yesEntropy, 2018
In this paper, a new family of binary LRCs (BLRCs) with locality 2 and uneven availabilities for hot data is proposed, which has a high information symbol availability and low parity symbol availabilities for the local repair of distributed storage ...
Kang-Seok Lee, Hosung Park, Jong-Seon No
doaj   +2 more sources

Optimal Locally Repairable Codes via Rank-Metric Codes [PDF]

open access: yes2013 IEEE International Symposium on Information Theory, 2013
This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems which possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node ...
Koyluoglu, O. Ozan   +3 more
core   +2 more sources

Optimal Binary Locally Repairable Codes via Anticodes [PDF]

open access: yes2015 IEEE International Symposium on Information Theory (ISIT), 2015
This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes.
Silberstein, Natalia, Zeh, Alexander
core   +2 more sources

Optimal Locally Repairable Linear Codes [PDF]

open access: yesIEEE Journal on Selected Areas in Communications, 2013
Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum Hamming distance ...
Dau, Son Hoang   +3 more
core   +2 more sources

Construction of Binary Locally Repairable Codes with Nonuniform Locality and Availability Using Combinatorial Designs [PDF]

open access: yesEntropy
In this paper, we generalize the construction of locally repairable codes (LRCs) by leveraging pairwise balanced designs (PBDs) and balanced incomplete block designs (BIBDs) to construct codes with nonuniform locality or nonuniform availability.
Yu Zhang, Xiangqiong Zeng
doaj   +2 more sources

List Decoding of Locally Repairable Codes [PDF]

open access: yes2018 IEEE International Symposium on Information Theory (ISIT), 2018
We show 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 new decoding radius is derived and the asymptotic behavior is
Holzbaur, Lukas, Wachter-Zeh, Antonia
core   +2 more sources

Home - About - Disclaimer - Privacy