Bounds and Constructions of Codes with Multiple Localities

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 as well as codes that achieve the extended alphabet-dependent bound. We give a family of binary ML-LRCs based on generalized code concatenation that is optimal with respect to the alphabet-dependent bound.
Liste complète des métadonnées

Littérature citée [21 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01253384
Contributeur : Alexander Zeh <>
Soumis le : dimanche 10 janvier 2016 - 08:32:14
Dernière modification le : dimanche 31 décembre 2017 - 09:44:02
Document(s) archivé(s) le : lundi 11 avril 2016 - 10:52:45

Fichiers

ML-LRC.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01253384, version 1
  • ARXIV : 1601.02763

Collections

Citation

Alexander Zeh, Eitan Yaakobi. Bounds and Constructions of Codes with Multiple Localities. 2016. 〈hal-01253384〉

Partager

Métriques

Consultations de la notice

149

Téléchargements de fichiers

42