Papers
Topics
Authors
Recent
Search
2000 character limit reached

Construction of two SD Codes

Published 6 May 2013 in cs.IT and math.IT | (1305.1221v1)

Abstract: SD codes are erasure codes that address the mixed failure mode of current RAID systems. Rather than dedicate entire disks to erasure coding, as done in RAID-5, RAID-6 and Reed-Solomon coding, an SD code dedicates entire disks, plus individual sectors to erasure coding. The code then tolerates combinations of disk and sector errors, rather than solely disk errors. It is been an open problem to construct general codes that have the SD property, and previous work has relied on Monte Carlo searches. In this paper, we present two general constructions that address the cases with one disk and two sectors, and two disks and two sectors. Additionally, we make an observation about shortening SD codes that allows us to prune Monte Carlo searches.

Citations (12)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. Mario Blaum 
  2. James S. Plank 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up