Regenerating codes for distributed storage networks

DOI10.1007/978-3-642-13797-6_15MaRDI QIDQ3578476zbMATH OpenOpenAlexFDO

Authors Nihar B. Shah, Korlakai Vinayak Rashmi, P. Vijay Kumar, Kannan Ramchandran

Publication date 20 July 2010

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13797-6_15

zbMATH Keywords

distributed storageinterference alignmentMDS codesregenerating codesrepair bandwidth

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• Network Coding for Distributed Storage Systems
• Codes for Distributed Storage
• Coding techniques for repairability in networked distributed storage systems
• Multilinear algebra for distributed storage
• Editorial

Cited in

(9)

• Coding techniques for repairability in networked distributed storage systems
• Robust Distributed Storage of Residue Encoded Data
• Research on distributed storage problems over unidirectional ring networks
• Region-based fault-tolerant distributed file storage system design in networks
• Network Coding for Distributed Storage Systems
• Codes for Distributed Storage
• Multilinear algebra for distributed storage
• Correcting adversarial errors with generalized regenerating codes
• On repairing erasure coded data in an active-passive mixed storage network

This page was built for publication: Regenerating codes for distributed storage networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578476)