Bounds and constructions of codes with multiple localities
Authors:
- 11 August 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 640-644
Abstract
This paper studies bounds and constructions of locally repairable codes (LRCs) with multiple localities so-called multiple-locality LRCs (ML-LRCs). In the simplest case of two localities some code symbols of an ML-LRC have a certain locality while the remaining code symbols have another one. We extend two bounds, the Singleton and the alphabet-dependent upper bound on the dimension of Cadambe-Mazumdar for LRCs, to the case of ML-LRCs with more than two localities. Furthermore, we construct Singleton-optimal ML-LRCs codes.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Bounds on the Size of Locally Recoverable CodesIEEE Transactions on Information Theory, 2015
- Optimal binary locally repairable codes via anticodes2015
- Codes With Local Regeneration and Erasure CorrectionIEEE Transactions on Information Theory, 2014
- Binary cyclic codes that are locally repairable2014
- A Family of Optimal Locally Recoverable CodesIEEE Transactions on Information Theory, 2014
- Locally Repairable CodesIEEE Transactions on Information Theory, 2014
- Optimal locally repairable codes via rank-metric codes2013
- Optimal locally repairable codes and connections to matroid theory2013
- Optimal linear codes with a local-error-correction property2012
- Pyramid Codes: Flexible Schemes to Trade Space for Access Efficiency in Reliable Data Storage Systems2007