arrow
返回

Girth-Based Sequential-Recovery LRCs

delete2022-01-01
delete0
delete
OA
AI
Z
Zhi Jing
H
Hong‐Yeop Song *
DOI:10.1109/ACCESS.2022.3225905delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we prove that a linear block code with girth 2(t + 1) is a t-sequential-recovery locally repairable codes (LRCs) with locality r if its parity-check matrix has column weight at least 2 and row weight at most r + 1. This gives a new connection between sequential-recovery LRCs and linear block codes. We also derive that the repair time of the t-sequential-recovery LRCs from the linear block codes by this connection is at most [t/2].
Keyword:
Locally repairable codes
joint sequential-parallel-recovery
girth
repair time

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

Y
Yonsei University
学者数:
4.8W
论文数: 4.6W
被引数: 5.2W
引用论文

引用论文

Psychiatric and Mental Health Nursing精神科和精神卫生护理
err
IF0
err1990-01-01
err0
PREAI
errWilliam Reynolds; Desmond F. S. Cormack
err分享
err收藏
Urbanization effect on ground beetles (Coleoptera, Carabidae)
err2019-11-08
err0
errOAAI
errRaisa A Sukhodolskaya; Anatoliy A Saveliev; Natalya I Eremeeva; Iraida G Vorobyova
err分享
err收藏
Structural Analysis of Array-Based Non-Binary LDPC Codes
err2016-12-01
err9
PREAI
errZhao, Shancheng; Huang, Xiujie; Ma, Xiao
err分享
err收藏
Column-Weight Three QC LDPC Codes with Girth 20
err2013-07-01
err13
PREAI
errGholami, Mohammad; Samadieh, Mehdi; Raeisi, Ghaffar
err分享
err收藏
学者 查看更多内容