Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
From MaRDI portal
Publication:5273483
DOI10.1109/TIT.2011.2159049zbMath1365.94561arXiv1005.4178MaRDI QIDQ5273483
Korlakai Vinayak Rashmi, Nihar B. Shah, P. Vijay Kumar
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1005.4178
Related Items (18)
Recursive methods for some problems in coding and random permutations ⋮ Construction of one special minimum storage regenerating code when α=2 ⋮ Fractional Repetition and Erasure Batch Codes ⋮ A survey and refinement of repairable threshold schemes ⋮ A class of minimum storage cooperative regenerating codes with low access property ⋮ Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction ⋮ Improved single-round secure multiplication using regenerating codes ⋮ A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ New bounds on the field size for maximally recoverable codes instantiating grid-like topologies ⋮ Multilinear Algebra for Distributed Storage ⋮ Codes for distributed storage from 3-regular graphs ⋮ Architecture-aware coding for distributed storage: repairable block failure resilient codes ⋮ Construction of minimum bandwidth regenerating codes with combinatorial design ⋮ Functional repair codes: a view from projective geometry ⋮ Self-repairing codes ⋮ Johnson graph codes ⋮ Codes for Distributed Storage
This page was built for publication: Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
