The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Códigos reparáveis localmente atraíram muito interesse em sistemas de armazenamento distribuído. Se um símbolo de um código puder ser reparado respectivamente por t grupos disjuntos de outros símbolos, cada grupo tem tamanho no máximo r, dizemos que o símbolo do código tem (r, t)-localidade. Neste artigo, empregamos matriz de verificação de paridade para construir informações de paridade única (r, t)-LRCs de localidade. Todos os nossos códigos atingem o limite de LRCs do tipo Singleton, onde cada grupo de reparo contém um único símbolo de paridade e, portanto, são ideais.
Yang DING
Shanghai University
Qingye LI
Shanghai University
Yuting QIU
Shanghai University
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.
Copiar
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
Copiar
@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},}
Copiar
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 -