Linear Locally Repairable Codes with Random Matrices
arXiv:1408.0180
Abstract
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find locally repairable codes.
13 pages
References in corpus (7)
- A family of optimal locally recoverable codes
- Codes with Local Regeneration
- MDS Array Codes with Optimal Rebuilding
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- Self-repairing Homomorphic Codes for Distributed Storage Systems
- Simple Regenerating Codes: Network Coding for Cloud Storage
- Optimal Locally Repairable Linear Codes