Construction of PMDS and SD Codes extending RAID 5
Mario Blaum
TL;DR
This paper presents a theoretical construction of PMDS and SD codes with two extra parities extending RAID 5, solving an open problem that previously required computational search methods.
Contribution
It offers a novel, mathematically grounded construction of PMDS and SD codes extending RAID 5, replacing previous computational approaches.
Findings
Provides a theoretical construction for PMDS and SD codes
Solves an open problem in coding theory for RAID extensions
Enhances reliability and efficiency of RAID systems
Abstract
A construction of Partial Maximum Distance Separable (PMDS) and Sector-Disk (SD) codes extending RAID 5 with two extra parities is given, solving an open problem. Previous constructions relied on computer searches, while our constructions provide a theoretical solution to the problem.
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 · Cooperative Communication and Network Coding