Girth-Based Sequential-Recovery LRCs

Zhi Jing, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review


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 ⌉.

Original languageEnglish
Pages (from-to)126156-126160
Number of pages5
JournalIEEE Access
Publication statusPublished - 2022

Bibliographical note

Funding Information:
This work was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korea Government through the Ministry of Science and ICT (MSIT) under Grant 2020R1A2C2011969.

Publisher Copyright:
© 2013 IEEE.

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Materials Science(all)
  • Engineering(all)
  • Electrical and Electronic Engineering


Dive into the research topics of 'Girth-Based Sequential-Recovery LRCs'. Together they form a unique fingerprint.

Cite this