Asymptotically optimal erasure-resilient codes for large disk arrays

Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2000-05, Vol.102 (1), p.3-36
Main Authors: Chee, Yeow Meng, Colbourn, Charles J., Ling, Alan C.H.
Format: Article
Language:English
Subjects:
Algebra
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Mathematics
Number theory
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in finite set theory. Solutions to some of these problems are characterized by well-known combinatorial designs. In other instances, combinatorial designs are shown to give asymptotically exact solutions to these problems. As a result, we improve, extend and generalize previous results of Hellerstein et al.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(99)00228-0