Multilinear algebra for distributed storage
From MaRDI portal
Publication:5157585
Abstract: An -ERRC (exact-repair regenerating code) is a collection of nodes used to store a file. For a file of total size , each node stores symbols, any nodes recover the file, and any nodes repair any other node via sending out symbols. We establish a multilinear algebra foundation to assemble -ERRCs for all meaningful tuples. Our ERRCs tie the -versus- trade-off with cascade codes, the best known construction for this trade-off. We give directions on how these ERRCs repair multiple failures.
Recommendations
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 108185 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- Advanced modern algebra. Part 1
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Cascade Codes for Distributed Storage Systems
- Cooperative Regenerating Codes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- Determinant Coding: A Novel Framework for Exact-Repair Regenerating Codes
- Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
- Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
- Multilinear algebra. 2nd ed
- Network Coding for Distributed Storage Systems
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
- Shortened Regenerating Codes
- ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
Cited in
(9)- Johnson graph codes
- Codes for Distributed Storage
- Explicit constructions of MSR codes for clustered distributed storage: the rack-aware storage model
- Correcting adversarial errors with generalized regenerating codes
- Regenerating codes for distributed storage networks
- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs
- Repairing multiple failures for algebraic geometry codes
- Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
This page was built for publication: Multilinear algebra for distributed storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157585)