Complete Characterizations of Optimal Locally Repairable Codes With Locality 1 and <inline-formula> <tex-math notation="LaTeX">$K-1$ </tex-math></inline-formula>
A locally repairable code (LRC) is a [n, k, d] linear code with length n, dimension k, minimum distance d and locality r, which means that every code symbol can be repaired by at most r other symbols. LRCs have become an important candidate in distributed storage systems due to their relatively low...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8794791/ |