IEICE TRANSACTIONS on Fundamentals
Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets
Summary :
Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E106-A No.1 pp.78-82
- Publication Date
- 2023/01/01
- Publicized
- 2022/08/03
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2022EAL2020
- Type of Manuscript
- LETTER
- Category
- Coding Theory
Authors
Yang DING
Shanghai University
Qingye LI
Shanghai University
Yuting QIU
Shanghai 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
Yang DING, Qingye LI, Yuting QIU, "Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 1, pp. 78-82, January 2023, doi: 10.1587/transfun.2022EAL2020.
Abstract: Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2022EAL2020/_p
Copy
@ARTICLE{e106-a_1_78,
author={Yang DING, Qingye LI, Yuting QIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets},
year={2023},
volume={E106-A},
number={1},
pages={78-82},
abstract={Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.},
keywords={},
doi={10.1587/transfun.2022EAL2020},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Constructions of Optimal Single-Parity Locally Repairable Codes with Multiple Repair Sets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 78
EP - 82
AU - Yang DING
AU - Qingye LI
AU - Yuting QIU
PY - 2023
DO - 10.1587/transfun.2022EAL2020
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2023
AB - Locally repairable codes have attracted lots of interest in Distributed Storage Systems. If a symbol of a code can be repaired respectively by t disjoint groups of other symbols, each groups has size at most r, we say that the code symbol has (r, t)-locality. In this paper, we employ parity-check matrix to construct information single-parity (r, t)-locality LRCs. All our codes attain the Singleton-like bound of LRCs where each repair group contains a single parity symbol and thus are optimal.
ER -
English
