On the Single-Parity Locally Repairable Codes
Lists
Only you see this
Abstract
Locally repairable codes (LRCs) have attracted much interest recently due to their applications in distributed storage systems. In an [n,k,d] linear code, a code symbol is said to have locality r if it can be repaired by accessing at most r other code symbols. An (n,k,r) LRC with locality r for the information symbols has minimum distance d≤n-k-⌈k/r⌉+2. In this letter, we study single-parity LRCs where every repair group contains exactly one parity symbol. Firstly, we give a new characterization of single-parity LRCs based on the standard form of generator matrices. For the optimal single-parity LRCs meeting the Singleton-like bound, we give necessary conditions on the structures of generator matrices. Then we construct all the optimal binary single-parity LRCs meeting the Singleton-like bound d≤n-k-⌈k/r⌉+2.
BibTeX
@article{lu2017single,
author = {Yanbo Lu and Jie Hao and Shu-Tao Xia},
title = {{On the Single-Parity Locally Repairable Codes}},
journal = {IEICE Trans. Fundam. Electron. Commun. Comput. Sci.},
year = {2017},
doi = {10.1587/transfun.e100.a.1342},
}Loading related content...