A construction of 2-sequential-recovery locally repairable codes

Zhi Jing, Hong‐Yeop Song · 2021 International Conference on Information and Communication Technology Convergence (ICTC) · 2021

We propose a new construction of 2-sequential-recovery locally repairable codes (2-seq LRCs) with any locality $r$ over an alphabet of size $q\geq r+1$ , which is rate-optimal and distance-optimal. The proposed construction is the first explicit optimal construction based on the parity check matrix, since the existed optimal 2-seq LRCs are based on the graph as far as we know. Some new 2-seq LRCs are found from the proposed construction.

Read the paper · More papers on PaperTik