Girth-Based Sequential-Recovery LRCs
Zhi Jing, Hong‐Yeop Song · IEEE Access · 2022
In this paper, we prove that a linear block code with girth 2(t+1) is at-sequential-recovery locally repairable codes (LRCs) with localityrif its parity-check matrix has column weight at least 2 and row weight at mostr+1. This gives a new connection between sequential-recovery LRCs and linear block codes. We also derive that the repair time of thet-sequential-recovery LRCs from the linear block codes by this connection is at most ⌈t/2⌉.