Papers › Multilinear Algebra for Distributed Storage
Multilinear Algebra for Distributed Storage
Iwan Duursma, Xiao Li, Hsin-Po Wang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
An (n, k, d, α, β, M)-ERRC (exact-repair regenerating code) is a collection of n nodes used to store a file. For a file of total size M, each node stores α symbols, any k nodes recover the file, and any d nodes repair any other node via sending out β symbols. We establish a multilinear algebra foundation to assemble (n, k, d, α, β, M)-ERRCs for all meaningful (n, k, d) tuples. Our ERRCs tie the α/M-versus-β/M trade-off with cascade codes, the best known construction for this trade-off. We give directions on how these ERRCs repair multiple failures.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections