IEICE TRANSACTIONS on Fundamentals
Cooperative Local Repair with Multiple Erasure Tolerance
Summary :
In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ1)c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.3 pp.765-769
- Publication Date
- 2016/03/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.765
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Jiyong LU
Nankai University
Xuan GUANG
Nankai University
Linzhi SHEN
Nankai University
Fang-Wei FU
Nankai University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jiyong LU, Xuan GUANG, Linzhi SHEN, Fang-Wei FU, "Cooperative Local Repair with Multiple Erasure Tolerance" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 3, pp. 765-769, March 2016, doi: 10.1587/transfun.E99.A.765.
Abstract: In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ1)c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.765/_p
Copy
@ARTICLE{e99-a_3_765,
author={Jiyong LU, Xuan GUANG, Linzhi SHEN, Fang-Wei FU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Cooperative Local Repair with Multiple Erasure Tolerance},
year={2016},
volume={E99-A},
number={3},
pages={765-769},
abstract={In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ1)c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.},
keywords={},
doi={10.1587/transfun.E99.A.765},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - Cooperative Local Repair with Multiple Erasure Tolerance
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 765
EP - 769
AU - Jiyong LU
AU - Xuan GUANG
AU - Linzhi SHEN
AU - Fang-Wei FU
PY - 2016
DO - 10.1587/transfun.E99.A.765
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2016
AB - In distributed storage systems, codes with lower repair locality are much more desirable due to their superiority in reducing the disk I/O complexity of each repair process. Motivated partially by both codes with information (r,δ1)c locality and codes with cooperative (r,l) locality, we propose the concept of codes with information (r,l,δ) locality in this paper. For a linear code C with information (r,l,δ) locality, values at arbitrary l information coordinates of an information set I can be recovered by connecting any of δ existing pairwise disjoint local repair sets with size no more than r, where a local repair set of l coordinates is defined as the set of some other coordinates by which one can recover the values at these l coordinates. We derive a lower bound on the codeword length n for [n,k,d] linear codes with information (r,l,δ) locality. Furthermore, we indicate its tightness for some special cases. Particularly, some existing results can be deduced from our bound by restriction on parameters.
ER -
English
