Local erasure correction codes with unequal locality profile
- 1 September 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1025-1032
Abstract
When a node of a distributed storage system fails, it needs to be repaired quickly enough to maintain system integrity. While typical erasure codes can provide significant storage advantage over replication, they suffer from poor repair efficiency. Locally repairable codes (LRCs) tackle this issue by reducing the number of nodes participating in the repair process (locality), at the cost of reduced minimum distance. In this paper, we study the tradeoff characteristics between locality and minimum distance for LRCs, where the local codes have an arbitrary distance requirement. In our study, different from previous approaches, the localities specified are not necessarily the same for every symbol. Such property can be advantageous for distributed storage systems with non-homogeneous characteristics. We present a new Singleton-type minimum distance upper bound and also provide an optimal code construction with respect to this bound.Keywords
This publication has 12 references indexed in Scilit:
- Codes with unequal locality2016
- Error-Correcting Regenerating and Locally Repairable Codes via Rank-Metric CodesIEEE Transactions on Information Theory, 2015
- Codes With Local Regeneration and Erasure CorrectionIEEE Transactions on Information Theory, 2014
- A Family of Optimal Locally Recoverable CodesIEEE Transactions on Information Theory, 2014
- Locally Repairable CodesIEEE Transactions on Information Theory, 2014
- Optimal Locally Repairable and Secure Codes for Distributed Storage SystemsIEEE Transactions on Information Theory, 2013
- Optimal locally repairable codes via rank-metric codes2013
- On the Locality of Codeword SymbolsIEEE Transactions on Information Theory, 2012
- Optimal linear codes with a local-error-correction property2012
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010