Double Circulant Minimum Storage Regenerating Codes
Bernat Gaston, Jaume Pujol
TL;DR
This paper introduces a novel class of regenerating codes called Double Circulant Minimum Storage Regenerating Codes, which aim to improve data recovery efficiency in distributed storage systems.
Contribution
It proposes a new construction of regenerating codes using double circulant matrices, enhancing storage efficiency and repair bandwidth.
Findings
Achieves optimal repair bandwidth for certain parameters
Demonstrates improved storage efficiency over existing codes
Provides explicit code constructions
Abstract
A newer version will appear soon
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Caching and Content Delivery · Cellular Automata and Applications