Locality and Availability in Distributed Storage

DOI10.1109/TIT.2016.2524510zbMath1359.68061arXiv1402.2011MaRDI QIDQ2976662

Alexandros G. Dimakis, A. S. Rawat, Sriram Vishwanath, Dimitris S. Papailiopoulos

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.2011

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (18)

PIR codes with short block length ⋮ Linear programming bounds for distributed storage codes ⋮ A family of codes with variable locality and availability ⋮ Anticode-based locally repairable codes with high availability ⋮ Two classes of optimal LRCs with information \((r, t)\)-locality ⋮ The complete hierarchical locality of the punctured simplex code ⋮ RS-like locally recoverable codes with intersecting recovering sets ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Multiset combinatorial batch codes ⋮ Locally repairable codes with multiple repair sets based on packings of block size 4 ⋮ Regular \((k, R, 1)\)-packings with \(\max(R)=3\) and their locally repairable codes ⋮ Optimal ternary locally repairable codes ⋮ Some new constructions of optimal linear codes and alphabet-optimal \((r, \delta)\)-locally repairable codes ⋮ On finding the largest minimum distance of locally recoverable codes: a graph theory approach ⋮ Optimal RS-like LRC codes of arbitrary length ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ On the locality of quasi-cyclic codes over finite fields

This page was built for publication: Locality and Availability in Distributed Storage