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 ⌉.
|Number of pages||5|
|Publication status||Published - 2022|
Bibliographical noteFunding 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.
© 2013 IEEE.
All Science Journal Classification (ASJC) codes
- Computer Science(all)
- Materials Science(all)
- Electrical and Electronic Engineering