Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction
From MaRDI portal
Publication:6115444
DOI10.1007/s00200-021-00526-3arXiv2006.16998MaRDI QIDQ6115444
Publication date: 12 July 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.16998
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes
- Johnson graph codes
- Explicit Minimum Storage Regenerating Codes
- Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs
- An Improved Sub-Packetization Bound for Minimum Storage Regenerating Codes
- Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
- Combinatorial Nullstellensatz
- Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization
- Minimum Storage Regenerating Codes for All Parameters
- Repairing Reed-Solomon Codes
- Shortened Regenerating Codes
- Cooperative Repair: Constructions of Optimal MDS Codes for All Admissible Parameters
- Repairing Reed-Solomon Codes With Multiple Erasures
- Network Coding for Distributed Storage Systems
- ϵ-MSR Codes: Contacting Fewer Code Blocks for Exact Repair
- Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes
- Cascade Codes for Distributed Storage Systems
- Multilinear Algebra for Distributed Storage
- Determinant Codes With Helper-Independent Repair for Single and Multiple Failures
- An exponential lower bound on the sub-packetization of MSR codes
- The Repair Problem for Reed–Solomon Codes: Optimal Repair of Single and Multiple Erasures With Almost Optimal Node Size
- Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
- Cooperative Regenerating Codes
- Codes for Distributed Storage
This page was built for publication: Multilinear algebra for minimum storage regenerating codes: a generalization of the product-matrix construction