TY - JOUR
T1 - Asymptotically optimal erasure-resilient codes for large disk arrays
AU - Chee, Yeow Meng
AU - Colbourn, Charles J.
AU - Ling, Alan C.H.
N1 - Funding Information:
Research of the authors is supported by the Army Research Office (USA) under grant number DAAG55-98-1-0272 (Colbourn). This work was begun while the authors were at the University of Waterloo, Waterloo, Ontario N2L 3G1, Canada.
PY - 2000/5/15
Y1 - 2000/5/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0003095851&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0003095851&partnerID=8YFLogxK
U2 - 10.1016/S0166-218X(99)00228-0
DO - 10.1016/S0166-218X(99)00228-0
M3 - Article
AN - SCOPUS:0003095851
SN - 0166-218X
VL - 102
SP - 3
EP - 36
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
IS - 1-2
ER -