Repair Optimal Erasure Codes Through Hadamard Designs
From MaRDI portal
Publication:2989268
DOI10.1109/TIT.2013.2241819zbMath1364.94769arXiv1106.1634OpenAlexW2154063365MaRDI QIDQ2989268
Alexandros G. Dimakis, Dimitris S. Papailiopoulos, Viveck R. Cadambe
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.1634
Related Items (4)
A class of minimum storage cooperative regenerating codes with low access property ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Construction of minimum bandwidth regenerating codes with combinatorial design ⋮ Codes for Distributed Storage
This page was built for publication: Repair Optimal Erasure Codes Through Hadamard Designs
